Samson Abramsky  Home/Search
Context Related
| web.comlab.ox.ac.uk/oucl/w...lazy.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 From: web.comlab.ox.ac.uk/oucl/work/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction The commonly accepted basis for functional programming is the -calculus; and it is folklore that the -calculus is the prototypical functional language in puri ed form. But what is the -calculus? The syntax is simple and classical; variables, abstraction and application in the pure calculus, with applied calculi obtained by adding constants. The further elaboration of the theory, covering conversion, reduction, theories and models, is laid out in Barendregt's already classical... (Update)
Cited by: More
A Naïve Time Analysis and its Theory of Cost Equivalence - Sands (1995) (Correct)
Towards Operational Semantics of Contexts in Functional Languages - Sands (Correct)
An Operational Semantics for Parallel Lazy Evaluation - Clem Baker-Finch University (Correct)
Active bibliography (related documents): More All
0.5: On Choosing between Experimenting and Thinking when Learning - Rivest, Sloan (1993) (Correct)
0.3: List Comprehensions and the Relational Calculus - Trinder, Wadler (1999) (Correct)
0.3: Computer-Based Tools For Regular Array Design - Wayne Luk (1989) (Correct)
Similar documents based on text: More All
0.2: Games and Full Abstraction for the Lazy lambda-calculus - Abramsky, McCusker (1995) (Correct)
0.1: Discrimination by Parallel Observers: the Algorithm - Dezani-Ciancaglini, Tiuryn, .. (1998) (Correct)
0.1: Lambda Calculi with Types - Barendregt (1992) (Correct)
Related documents from co-citation: More All
27: Equality in lazy computation systems - Howe - 1989
24: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
24: Communication and Concurrency (context) - Milner - 1989
BibTeX entry: (Update)
Samson Abramsky. The lazy lambda calculus. In David Turner, editor, Research Topics in Functional Programming, UT Year of Programming Series, pages 65--117. Addison-Wesley, 1990. http://citeseer.ist.psu.edu/abramsky90lazy.html More
@incollection{ abramsky90lazy,
author = "S. Abramsky",
title = "The Lazy Lambda Calculus",
booktitle = "Research Topics in Functional Programming",
publisher = "Addison-Welsey",
address = "Reading, MA",
editor = "D. A. Turner",
isbn = "0-201-17236-4",
pages = "65--116",
year = "1990",
url = "citeseer.ist.psu.edu/abramsky90lazy.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986 ACM
306 LCF considered as a programming language (context) - Plotkin DBLP
218 The mechanical evaluation of expressions (context) - Landin - 1964
216 Theoretical Computer Science (context) - Milner, synchrony - 1983 ACM
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
118 Lambda Calculus Models of Programming Languages (context) - Morris - 1968
86 A correspondence between ALGOL 60 and Church's lambda notati.. (context) - Landin - 1965
75 Domain theory in logical form (context) - Abramsky - 1987 DBLP
75 Domain theory in logical form (context) - Abramsky - 1987 DBLP
72 Fully abstract models of typed lambda-calculi (context) - Milner
67 Recursive programming techniques (context) - Burge - 1975
59 A compiler for lazy ML (context) - Augustsson - 1984 ACM DBLP
32 Functional Programming: Applications and Implementation (context) - Henderson - 1980
30 Relating theories of lambda calculus (context) - Scott - 1980
15 Partial Lambda Calculus - Moggi - 1987
11 Set-theoretical models of lambda calculus: theories (context) - Longo - 1983
7 Continuity and E ectiveness in Topoi (context) - Rosolini - 1986
7 Design and implementation of a simple typed language based o.. (context) - Fairbairn - 1985
6 Extended type structure and lter lambda models (context) - Coppo, Dezani-Ciancaglini et al. - 1984
4 a non-strict functional language with polymorphic types (context) - Turner - 1985
4 Lectures on predomains and partial functions (context) - Plotkin
4 Functional programming and the language TALE (context) - Barendregt, van Leeuwen - 1986
3 Introduction to ORWELL (context) - Wadler - 1985
2 Information and Control (context) - Jozef, of et al. - 1982
1 Computing laboratory and DPMMS (context) - Robinson, Rosolini et al. - 1987
1 Partial cartesian closed categories of e ective objects (context) - Moggi
1 Department of Computing (context) - Abramsky, equation et al. - 1987
1 Categories of partial morphisms and the lambda p -calculus (context) - Moggi - 1986
1 Workshop on Semantics of Programming Languages (context) - Dybjer, Nordstr et al. - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/): More
Computational Interpretations of Linear Logic - Abramsky (1993) (Correct)
Algorithmic Game Semantics - Abramsky (Correct)
A Structural Approach to Reversible Computation - Abramsky (2001) (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