Lins, Rafael D. and Thompson, Simon and Jones, Simon L. Peyton (1994) On the Equivalence Between CMC and TIM. Journal of Functional Programming, 1 (4). (doi:https://doi.org/10.1017/S0956796800000939) (Full text available)
Download (340kB)
Preview
|
|
|
Postscript | ||
Download (197kB)
Preview
|
|
|
Official URL http://dx.doi.org/10.1017/S0956796800000939 |
Abstract
In this paper we present the equivalence between TIM, a machine developed to implement lazy functional programming languages, and the set of Categorical Multi-Combinators, a rewriting system developed with similar aims. A Complete revision of UKC - Lab.Report 67 (Submitted to Journal of Functional Programming)
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: |
Faculties > Sciences > School of Computing > Theoretical Computing Group Faculties > Sciences > School of Computing > Systems Architecture Group |
Depositing User: | Mark Wheadon |
Date Deposited: | 12 Aug 2009 19:47 UTC |
Last Modified: | 14 Jul 2014 08:27 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21166 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):