87 search results - page 8 / 18 » Functions and Lazy Evaluation in Prolog |
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
ICLP
1997
Springer
14 years 22 days ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
GI
2009
Springer
14 years 1 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
IFL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
PEPM
2010
ACM
14 years 5 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...