Sciweavers

1164 search results - page 153 / 233
» Type based service composition
Sort
View
141
Voted
FPCA
1995
15 years 7 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
149
Voted
PPSC
1997
15 years 4 months ago
Parallel Extensions to the Matrix Template Library
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
Andrew Lumsdaine, Brian C. McCandless
132
Voted
JANCL
2007
106views more  JANCL 2007»
15 years 3 months ago
Dynamic logic for belief revision
ABSTRACT. We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consist...
Johan van Benthem
260
Voted
AMW
2011
14 years 7 months ago
Subqueries in SPARQL
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
Renzo Angles, Claudio Gutierrez
129
Voted
JNW
2006
147views more  JNW 2006»
15 years 3 months ago
Dependability Considerations in Wireless Sensor Networks Applications
Recently, the use of wireless sensor networks has spread to applications areas that are not viable or costefficient to be run on other types of networks. Due to some critical tasks...
Amirhosein Taherkordi, Majid Alkaee Taleghan, Mohs...