|
 ABSTRACT
We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational structure we introduce is a set of bindings which corresponds closely to a heap. The semantics is set at a considerably higher level of abstraction than operational semantics for particular abstract machines, so is more suitable for a variety of proofs. Furthermore, because a heap is explicitly modelled, the semantics provides a suitable framework for studies about space behaviour of terms under lazy evaluation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
Abr90
|
S.Abramsky, The Lazy Lambda Calculus, in D.Turner ed., Declarative Programming, Addison-Wesley, } 990.
|
 |
AA91
|
|
| |
ANP89
|
|
| |
FW87
|
|
| |
Jon84
|
|
| |
Jos89
|
|
| |
KL89
|
P. J. Koopman, Jr. , P. Lee, A fresh look at combinator graph reduction, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.110-119, June 19-23, 1989, Portland, Oregon, United States
|
| |
Lau92
|
John Launchbury , Andy Gill , John Hughes , Simon Marlow , Simon L. Peyton Jones , Philip Wadler, Avoiding Unnecessary Updates, Proceedings of the 1992 Glasgow Workshop on Functional Programming, p.144-153, July 06-08, 1992
|
| |
Lév80
|
J.-J.L~vy, Optzmal Reductions in the Lambda Calculus, in Seldin and Hindley eds., ~/b H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formahsm, pp }59-19!, Academic Press, 1980.
|
| |
Mar91
|
|
| |
Ong88
|
C.-H.L.Ong, The Lazy Larnbda Calculus: An Investzgation in the Foundations of Functwnal Programming, Phi)Thesis, Imperial College, London, 1988.
|
| |
Pey92
|
S.Peyton Jones, Implementing Lazy Functional Languages on Stock Hardware: the Spineless Tagless G-Machine, Journal of Functional Programming, CUP, 1992, to appear.
|
| |
PL91
|
|
| |
PS92
|
|
| |
SP92
|
|
CITED BY 61
|
|
|
|
|
Greg Morrisett , Matthias Felleisen , Robert Harper, Abstract models of memory management, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.66-77, June 26-28, 1995, La Jolla, California, United States
|
|
|
|
|
|
|
|
|
David N. Turner , Philip Wadler , Christian Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.1-11, June 26-28, 1995, La Jolla, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Patrick M. Sansom , Simon L. Peyton Jones, Time and space profiling for non-strict, higher-order functional languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-366, January 23-25, 1995, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
B. Brassel , M. Hanus , F. Huch , G. Vidal, A semantics for tracing declarative multi-paradigm programs, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.179-190, August 24-26, 2004, Verona, Italy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.3