| Alternate document: Details The Call-by-Need Lambda Calculus (Unabridged) (94) John Maraist, Martin Odersky, Philip Wadler |
John Maraist, Martin Odersky  Home/Search
Context Related
Links: ACM DBLP | unisa.edu.au/~cisjpm/Pape...JFP98.ps.gz belllabs.com/who/...needjournal.ps.gz belllabs.com/cm/c...needjournal.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: unisa.edu.au/~cisjpm/Papers/ (more) From: diku.dk/~hniss/laesegruppe (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus. The system can be formulated with or without explicit let bindings, admits useful notions of marking and developments, and has a straightforward operational interpretation. Introduction The correspondence between call-by-value lambda calculi and... (Update)
Cited by: More
Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (Correct)
An Abstract Monadic Semantics for Value Recursion - Moggi, Sabry (2003) (Correct)
A Calculus for Probabilistic Languages - Sungwoo Park School (2003) (Correct)
Similar documents (at the sentence level):
8.2%: The Call-by-Need Lambda Calculus (Unabridged) - Maraist, Odersky, Wadler (1994) (Correct)
Active bibliography (related documents): More All
0.4: A Natural Semantics for Lazy Evaluation - Launchbury (1993) (Correct)
0.4: Separating Weakening and Contraction in a Linear Lambda Calculus.. - Maraist (1996) (Correct)
0.4: Classical linear natural deduction and the linear.. - Maraist (1999) (Correct)
Similar documents based on text: More All
0.1: A Statically Safe Alternative to Virtual Types - Bruce, Odersky, Wadler (1998) (Correct)
0.1: Finer Control of Weakening and Contraction: Towards a.. - Maraist (1996) (Correct)
0.1: Tracing Lazy Functional Languages - Wansbrough (1995) (Correct)
Related documents from co-citation: More All
34: A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
18: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
11: call-by-value and the lambda calculus (context) - Plotkin - 1975
BibTeX entry: (Update)
J. Maraist, M. Odersky, and P. Wadler, The call-by-need lambda calculus, Technical report, Fakultat fur Informatik, Universitat Karlsruhe, and Department of Computing Science, University of Glasgow, October 1994. http://citeseer.ist.psu.edu/maraist94callbyneed.html More
@article{ maraist98callbyneed,
author = "John Maraist and Martin Odersky and Philip Wadler",
title = "The Call-by-Need Lambda Calculus",
journal = "Journal of Functional Programming",
volume = "8",
number = "3",
pages = "275-317",
year = "1998",
url = "citeseer.ist.psu.edu/maraist94callbyneed.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
210 Implementing lazy functional languages on stock hardware: th.. - Jones - 1992 DBLP
185 The Calculi of Lambda Conversion (context) - Church - 1941
179 The Lazy Lambda Calculus - Abramsky - 1990 ACM
169 The call-by-need lambda calculus - Ariola, Felleisen - 1994 ACM DBLP
169 A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995 ACM
114 A natural semantics for lazy evaluation - Launchbury - 1993 ACM DBLP
92 Explicit substitutions - Abadi, Cardelli et al. - 1990 ACM DBLP
87 Notions of computation and monads - Moggi - 1991 ACM DBLP
81 Once upon a type - Mossin, Turner et al. - 1995 ACM DBLP
72 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
70 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990 ACM DBLP
66 Efficient compilation of lazy evaluation - Johnsson - 1984 ACM DBLP
45 Strong Normalization in a Typed Lambda Calculus with Lambda .. (context) - Nederpelt - 1973
42 On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990 ACM DBLP
42 Call-by-name (context) - Plotkin - 1975
33 The Design and Implementation of Programming Languages (context) - Hughes - 1983
29 A syntax for linear logic - Wadler - 1993 ACM DBLP
24 The call-by-need lambda calculus - Maraist, Odersky et al. - 1994 ACM DBLP
20 Cyclic lambda calculi - Ariola, Blom - 1997 ACM DBLP
17 Semantics of weakening and contraction (context) - Jacobs - 1994 DBLP
15 Optimal reductions in the lambda-calculus (context) - Levy - 1980
15 The Geometry of Implementation (context) - Mackie - 1994
12 Fully abstract models of the lazy lambda calculus (context) - Ong - 1988 DBLP
12 An adequate operational semantics of sharing in lazy evaluat.. (context) - Purushothaman, Seaman - 1992 ACM
8 The semantics of lazy functional languages (context) - Josephs - 1989 ACM DBLP
8 Time and space profiling for non-strict (context) - Sansom, Peyton - 1995
7 Call-by-name (context) - Maraist, Odersky et al. - 1995
6 Comparing Reduction Strategies in Resource-Conscious Lambda .. (context) - Maraist - 1997
6 Optimal reduction in weak-lambda-calculus with shared enviro.. (context) - Yoshida - 1993 DBLP
5 A fresh look at combinator graph reduction (context) - Koopman, Jr - 1989 ACM DBLP
5 DILL --- dual intuitionistic linear logic (context) - Barber - 1995
1 A taste of linear logic (context) - Verlag, Wadler - 1993 ACM DBLP
1 Optimal derivations in weak lambda-calculi and in orthogonal.. (context) - Report, Karlsruhe et al. - 1991 ACM
1 Modelling sharing and recursion for weak reduction strategie.. (context) - Benaisaissa, -El-A et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.unisa.edu.au/~cisjpm/Papers/): More
Call-by-Name, Call-by-Value, Call-by-Need, and the.. - Maraist, Odersky.. (1998) (Correct)
A Graph Reduction Technique with Sharing across Narrowings.. - Maraist, Silbermann (1994) (Correct)
Call-by-Need Splits the Mode! - Maraist (1993) (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