Partial Categorical Multi-Combinators and Church-Rosser Theorems

Lins, Rafael D. (1992) Partial Categorical Multi-Combinators and Church-Rosser Theorems. Technical report. University of Kent, Canterbury, UK (Full text available)

PDF
Download (165kB)
[img]
Preview
Postscript
Download (161kB)
[img]
Preview

Abstract

Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Categorical Multi-Combinators consists of only four rewriting laws with a very low pattern-matching complexity. This system allows the equivalent of several beta-reductions to be performed at once, as functions form frames with all their arguments. Although this feature is convenient for most cases of function application it does not allow partially parameterised functions to fetch arguments. In this paper we present Partial Categorical Multi-Combinators, a new rewriting system, which removes this drawback. (Submitted to Formal Aspects of Computer Science)

Item Type: Monograph (Technical report)
Additional information: Later version published in Journal of Universal Computer Science, vol. 10, no. 7 (2004), pp 769-788 ISSN 0948-695X
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 25 Mar 2010 22:03
Last Modified: 23 Jun 2014 10:22
Resource URI: http://kar.kent.ac.uk/id/eprint/21058 (The current URI for this page, for reference purposes)
ORCiD (Lins, Rafael D.):
  • Depositors only (login required):

Downloads

Downloads per month over past year