(Enter summary)
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... (Update)
Cited by: More
Improving the Lazy Krivine Machine - Daniel Friedman Abdulaziz
(Correct)
An Operational Semantics for Parallel Lazy Evaluation - Clem Baker-Finch University
(Correct)
A Functional Correspondence between Call-by-Need Evaluators and.. - Ager, al. (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Avoiding Unnecessary Updates - John Launchbury
(Correct)
0.5: Representing Demand by Partial Projections - Launchbury, Baraki (1993)
(Correct)
0.4: The Call-by-Need Lambda Calculus (Unabridged) - Maraist, Odersky, Wadler (1994)
(Correct)
Similar documents based on text: More All
0.6: A Modular Fully-lazy Lambda Lifter in HASKELL - Jones, Lester (1991)
(Correct)
0.1: A Free Logical Foundation for Nonstrict Functions - Gumb, Lambert
(Correct)
0.0: Lazy Imperative Programming - Launchbury (1993)
(Correct)
Related documents from co-citation: More All
52: A call-by-need lambda calculus
- Ariola, Felleisen et al. - 1995
27: Deriving a lazy abstract machine
- Sestoft - 1997
22: Implementing lazy functional languages on stock hardware: the Spineless Tagless ..
- Jones - 1992
BibTeX entry: (Update)
J. Launchbury. A natural semantics for lazy evaluation. In Proceedings of the 20th ACM Conference on Principles of Programming Languages, pages 144--154, 1993. http://citeseer.ist.psu.edu/launchbury93natural.html More
@inproceedings{ launchbury93natural,
author = "John Launchbury",
title = "A Natural Semantics for Lazy Evaluation",
booktitle = "Conference Record of the Twentieth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
address = "Charleston, South Carolina",
pages = "144--154",
year = "1993",
url = "citeseer.ist.psu.edu/launchbury93natural.html" }
Citations (may not include all citations):
210
Implementing Lazy Functional Languages on Stock Hardware: th..
- Peyton - 1992
179
The Lazy Lambda Calculus
- Abramsky - 1990
152
Structures: Data Structures for Parallel Computing
- Arvind, Nikhil - 1989
66
Efficient Compilation of Lazy Evaluation
- Johnsson - 1984
63
Optimal Reductions in the Lambda Calculus (context) - L'evy - 1980
34
Optimal Derivations in Weak Lambda-calculi and in Orthogonal..
- Maranget - 1991
26
A Syntactic Approach to Program Transformations
- Ariola - 1991
12
An Adequate Operational Semantics of Sharing in Lazy Evaluat.. (context) - Purushothaman, Seaman - 1992
8
The Semantics of Lazy Functional Languages (context) - Josephs - 1989
5
A Fresh Look at Combinator Graph Reduction (context) - Koopman, Lee - 1989
5
A Fully-Lazy Lambda-Lifter in Haskell (context) - Peyton, Lester - 1991
2
The Lazy Lambda Calculus: An Investigation in the Foundation.. (context) - Ong - 1988
2
A Simple Lazy Abstract-Machine to Execute Supercombinators (context) - Fairbairn, Wray - 1987
1
Glasgow Functional Programming Workshop (context) - Launchbury, Gill et al. - 1992
1
Glasgow Functional Programming Workshop (context) - Sansom, Peyton et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.inf.fu-berlin.de/lehre/WS96/se-ifs/themen.html): More
Two Models For Integrating Persistence and Lazy Functional.. - McNally, Davie (1991)
(Correct)
Cyclic Weighted Reference Counting without Delay - Jones, Lins (1992)
(Correct)
Optimizing Lazy Functional Programs Using Flow Inference - Faxen (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC