Lins, Rafael D., Thompson, Simon, Jones, Simon L. Peyton (1994) On the Equivalence Between CMC and TIM. Journal of Functional Programming, 1 (4). (doi:10.1017/S0956796800000939) (KAR id:21166)
PDF
Language: English |
|
Click to download this file (207kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Postscript
Language: English |
|
Click to download this file (197kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
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 |
---|---|
DOI/Identification number: | 10.1017/S0956796800000939 |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 12 Aug 2009 19:47 UTC |
Last Modified: | 16 Nov 2021 09:59 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21166 (The current URI for this page, for reference purposes) |
Thompson, Simon: |
![]() |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):