1020 search results - page 143 / 204 » Tight Semantics for Logic Programs |
ICLP
1999
Springer
15 years 7 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...
133
Voted
ICFP
2005
ACM
16 years 3 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...
127
Voted
PEPM
2010
ACM
16 years 5 days 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...
119
click to vote
ICFP
2004
ACM
16 years 3 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...
102
click to vote
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 6 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...