Hostname: page-component-745bb68f8f-d8cs5 Total loading time: 0 Render date: 2025-01-13T13:02:03.315Z Has data issue: false hasContentIssue false
  • English
  • Français

The call-by-need lambda calculus

Published online by Cambridge University Press:  01 May 1998

JOHN MARAIST ,
MARTIN ODERSKY  and
PHILIP WADLER
JOHN MARAIST
Affiliation:
School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, Adelaide, SA 5095, Australia; e-mail: maraist@cis.unisa.edu.auodersky@cis.unisa.edu.au
MARTIN ODERSKY
Affiliation:
School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, Adelaide, SA 5095, Australia; e-mail: maraist@cis.unisa.edu.auodersky@cis.unisa.edu.au
PHILIP WADLER
Affiliation:
Bell Laboratories, Lucent Technologies, 700 Mountain Ave., Room 2T-304, Murray Hill, NJ 07974-0636, USA; e-mail: wadler@research.bell-labs.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Journal of Functional Programming , Volume 8 , Issue 3 , May 1998 , pp. 275 - 317
Copyright
© 1998 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.