Sciweavers

87 search results - page 6 / 18
» Functions and Lazy Evaluation in Prolog
Sort
View
DAGSTUHL
1996
15 years 1 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
ICFP
2007
ACM
15 years 11 months ago
Lazy call-by-value evaluation
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
Bernd Braßel, Frank Huch, Germán Vida...
AGTIVE
2007
Springer
15 years 5 months ago
A Single-Step Term-Graph Reduction System for Proof Assistants
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
SIGGRAPH
1999
ACM
15 years 4 months ago
Direct Illumination with Lazy Visibility Evaluation
In this paper we present a technique for computing the direct lighting in a three-dimensional scene containing area light sources. Our method correctly handles partial visibility ...
David Hart, Philip Dutré, Donald P. Greenbe...
ESOP
2012
Springer
13 years 7 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen