School of Computing

On the Equivalence Between CMC and TIM

Raphael Lins, Simon Thompson, and Simon Peyton Jones

Journal of Functional Programming, 1(4):182-196, November 1994.

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)

Download publication 75 kbytes

Bibtex Record

@article{107,
author = {Raphael Lins and Simon Thompson and Simon Peyton Jones},
title = {{On the Equivalence Between CMC and TIM}},
month = {November},
year = {1994},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1994/107},
    journal = {Journal of Functional Programming},
    number = {4},
    volume = {1},
    year = {1994},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014