Sciweavers

161 search results - page 2 / 33
» Lazy call-by-value evaluation
Sort
View
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
15 years 5 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
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...
POPL
2009
ACM
16 years 9 days ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
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...
SIGMOD
2004
ACM
119views Database» more  SIGMOD 2004»
15 years 11 months ago
Lazy Query Evaluation for Active XML
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, I...