Partial Categorical Multi-Combinators and Church-Rosser Theorems
Rafael Dueire Lins · Kent Academic Repository (University of Kent) · 2020
Abstract. Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. 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. Resumo. Este artigo descreve o sistema de reescrita dos Multi-Combinadores Categóricos Parciais, que possui a propriedade de efetuar o equivalente a uma série de β reduções do λ-cálculo em um único passo de reescrita e possibilita aplicações parciais.