Sciweavers

161 search results - page 27 / 33
» Lazy call-by-value evaluation
Sort
View
OOPSLA
2004
Springer
14 years 27 days ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...
ICFP
1998
ACM
13 years 11 months ago
Functional Differentiation of Computer Programs
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
Jerzy Karczmarczuk
PLILP
1992
Springer
13 years 11 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl
HASKELL
2007
ACM
13 years 11 months ago
A lightweight interactive debugger for haskell
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...
Simon Marlow, José Iborra, Bernard Pope, An...
FPCA
1995
13 years 11 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin