The Lazy Lambda Calculus with Constants
No Thumbnail Available
Date
1994-07-01T00:00:00Z
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this paper we define the Lazy Lambda Calculus with constants, which extends Abramsky's pure lazy Lambda Calculus. This calculus forms a model for modern lazy functional programming languages. Such languages usually provide a call-by-value facility which is able to distinguish between the values _|_ and \x._|_. We study the operational and denotational semantics of this calculus both with and without a superimposed type inference system. Finally we compare the operational and denotational semantics, and give a limited full-abstraction result based on that of Plotkin.