Article contents
On the equivalence between CMC and TIM
Published online by Cambridge University Press: 07 November 2008
Abstract
In this paper we present an equivalence between TIM, a machine developed to implement non-strict functional programming languages, and the set of Categorical Multi-Combinators, a rewriting system developed with similar aims. These two models of computation at first appear to be quite different, but we show a direct equivalence between them, thereby adding some new structure to the ‘design-space’ of abstract machines for non-strict languages.
- Type
- Articles
- Information
- Copyright
- Copyright © Cambridge University Press 1994
References
- 5
- Cited by
Discussions
No Discussions have been published for this article.