© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Partial categorical multi-combinators and church-rosser theorems
Raphael D Lins
Technical Report 7-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, May 1992.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)
Download publication
63 kbytes
Bibtex Record
@techreport{105, author = {Raphael D Lins}, title = {Partial Categorical Multi-Combinators and Church-Rosser Theorems}, month = {May}, year = {1992}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/1992/105}, address = {University of Kent, Canterbury, UK}, hensa_abstractfilename = {pub/misc/ukc.reports/comp.sci/abstracts/7-92}, hensa_ftpaddress = {unix.hensa.ac.uk}, hensa_reportfilename = {pub/misc/ukc.reports/comp.sci/reports/7-92.ps.Z}, institution = {University of Kent, Computing Laboratory}, number = {7-92*}, }