Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler  @ NUS Home/Search
Context Related
| belllabs.com/who/wadler/p...need.ps.gz unisa.edu.au/~cisjpm/Pap...POPL95.ps.gz unisa.edu.au/~cismxo/pap...popl95.ps.gz Cached: PS.gz PS PDF Image Update Help From: diku.dk/users/skal...bibliography (more) From: unisa.edu.au/~cisjpm/Papers...all (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major obstacle for compiler writers. They cannot explain the behavior of their evaluator in terms of source level syntax, and they cannot easily compare distinct implementations of different lazy strategies. In this paper we derive an equational characterization of call-by-need and prove it correct with respect to the original lambda calculus. The theory is a strictly smaller... (Update)
Cited by: More
Technical Report - Number Computer Laboratory (Correct)
Unknown - Expansion Variables For (Correct)
An Operational Semantics for Parallel Lazy Evaluation - Clem Baker-Finch University (Correct)
Similar documents (at the sentence level):
16.2%: The Call-by-Need Lambda Calculus (Unabridged) - Maraist, Odersky, Wadler (1994) (Correct)
10.8%: The Call-By-Need Lambda Calculus - Ariola, Felleisen (1993) (Correct)
9.5%: The Call-by-Need Lambda Calculus - Maraist, Odersky (1994) (Correct)
Active bibliography (related documents): More All
0.6: Cyclic Lambda Graph Rewriting - Ariola, Klop (1994) (Correct)
0.3: A Natural Semantics for Lazy Evaluation - Launchbury (1993) (Correct)
0.2: Evaluation under λ-Abstraction - Xi (1996) (Correct)
Similar documents based on text: More All
0.5: Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (Correct)
0.4: Tracing Lazy Functional Languages - Wansbrough (1995) (Correct)
0.3: Finer Control of Weakening and Contraction: Towards a.. - Maraist (Correct)
Related documents from co-citation: More All
42: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
36: A natural semantics for lazy evaluation - Launchbury - 1993
21: The call-by-need lambda calculus - Maraist, Odersky et al. - 1994
BibTeX entry: (Update)
Zena Ariola, Matthias Felleisen, John Maraist, Martin Odersky, and Philip Wadler. A call-by-need lambda calculus. In 22'nd ACM Symposium on Principles of Programming Languages, San Francisco, California, 1995. http://citeseer.comp.nus.edu.sg/132534.html More
@misc{ ariola95callbyneed,
author = "Z. Ariola and M. Felleisen and J. Maraist and M. Odersky and P. Wadler",
title = "A call-by-need lambda calculus",
text = "Zena Ariola, Matthias Felleisen, John Maraist, Martin Odersky, and Philip
Wadler. A call-by-need lambda calculus. In 22'nd ACM Symposium on Principles
of Programming Languages, San Francisco, California, 1995.",
year = "1995",
url = "citeseer.comp.nus.edu.sg/132534.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
179 The lazy lambda calculus - Abramsky - 1990
169 The call-by-need lambda calculus - Ariola, Felleisen - 1994
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
137 Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
114 A natural semantics for lazy evaluation - Launchbury - 1993
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
72 Semantics And Pragmatics Of The Lambda-Calculus (context) - Wadsworth - 1971
70 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
65 Equivalence in functional languages with effects - Mason, Talcott - 1991
49 Equational term graph rewriting - Ariola, Klop - 1994
49 Cons should not evaluate its arguments (context) - Friedman, Wise - 1976
42 On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990
36 Parameter-passing and the lambda calculus - Crank, Felleisen - 1990
36 Parameter-passing and the lambda calculus - Crank - 1990
34 Optimal derivations in weak lambdacalculi and in orthogonal .. - Maranget - 1991
24 The callby -need lambda calculus - Maraist, Odersky et al. - 1994
23 and the lambda-calculus (context) - Felleisen, Friedman et al. - 1986
22 Explicit cyclic substitutions - Rose - 1992
22 Cyclic lambda graph rewriting - Ariola, Klop - 1994
16 Properties of a firstorder functional language with sharing - Ariola - 1995
16 Call-by-need and continuation-passing style - Okasaki, Lee et al. - 1994
13 Optimal reduction in weak--calculus with shared environments (context) - Yoshida - 1993
12 An adequate operational semantics of sharing in lazy evaluat.. (context) - Purushothaman - 1992
6 Optimal Interpreters for Lambdacalculus Based Funtional Lang.. (context) - Kathail - 1990
6 Reasoning about programs with effects - Mason, Talcott - 1990
5 A fully-lazy lambda lifter in haskell (context) - Jones - 1991
3 Sharing of computation in functional language implementation.. (context) - Arvind, Kathail - 1984
1 Departement of computer science (context) - Morrisett, Felleisen et al. - 1994
1 An Operational Semantics of Lazy Evaluation for Analysis (context) - Seaman - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/users/skalberg/papers/bibliography.html): More
All Structured Programs have Small Tree-Width and Good Register.. - Thorup (1998) (Correct)
PVS Prover Guide - Version 2.2 - Shankar, Owre, Rushby.. (Correct)
The Call-by-Need Lambda Calculus - Maraist, Odersky (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.