4370 search results - page 653 / 874 » Algebra of Logic Programming |
255
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
252
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 ...
149
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
116
click to vote
ICFP
2005
ACM
16 years 4 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...
116
click to vote
ICFP
2003
ACM
16 years 4 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...