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:45Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:45Z | |
| dc.date.issued | 1994-07-01T00:00:00Z | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 214934 bytes | en_US |
| dc.format.extent | 72995 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/1370 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA7/94 | en_US |
| dc.title | The Lazy Lambda Calculus with Constants | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1