Bohm Tree for the Lazy Lambda Calculus with Constants
No Thumbnail Available
Date
1994-08-01T00:00:00Z
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this paper we present a Boehm Tree model for the Lazy Lambda Calculus with constants, which extends Abramsky's pure Lazy Lambda Calculus. The Lazy Lambda Calculus with constants forms a basis for modern lazy functional programming languages, which usually provide a call-by-value facility which is able to distinguish between the values _|_ and \x._|_, as well as providing strict arithmetic primitives. The Boehm Tree model we present also acts as an improved model for the pure Lazy Lambda Calculus. In addition, the paper provides a framework for studies of Boehm Trees in more general systems.