Bohm Tree for the Lazy Lambda Calculus with Constants
| dc.contributor.author | Anthony H Dekker | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:44Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:44Z | |
| dc.date.issued | 1994-08-01T00:00:00Z | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 177193 bytes | en_US |
| dc.format.extent | 53619 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1371 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA8/94 | en_US |
| dc.title | Bohm Tree for the Lazy Lambda Calculus with Constants | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1