3481 search results - page 518 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
242
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
265
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
231
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
109
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
111
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...