1020 search results - page 143 / 204 » Tight Semantics for Logic Programs |
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
100
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
ICFP
2004
ACM
15 years 11 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 3 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...