Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 10 / Issue 7

available in:   PDF (190 kB) PS (173 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-010-07-0769


Partial Categorical Multi-Combinators and Church-Rosser Theorems

Rafael Dueire Lins (Departamento de Eletronica e Sistemas, Universidade Federal de Pernambuco, Brazil)

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 -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. This paper presents Partial Categorical Multi-Combinators, a new rewriting system, which removes this drawback.

Keywords: categorical combinators, explicit substitutions, functional programming

Categories: D.3.2, F.4.1