A new formula for the execution of categorical combinators
Categorical Combinators form a formal system similar to Curry's Combinatory Logic. It was developed by Curien  inspired by the equivalence of the theories of typed λ-calculus and Cartesian Closed Categories as shown by Lambek  and Scott . In this paper we show how to “execute” Categorical Combinators in an efficient way using a rewriting system. This efficiency is achieved by cutting down the number of laws, by introducing constants in a different way and choosing a more compact notation for the code.
KeywordsCategorical Combinators lambda calculus functional programming complexity
Unable to display preview. Download preview PDF.
- 1.N.G. DeBruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, Indag.Math. 34, 381–392 (1972).Google Scholar
- 2.P-L.Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Draft version of a monograph submitted to publication, Université Paris VII, LITP (1985).Google Scholar
- 3.J.Lambek, From Lambda-calculus to Cartesian Closed Categories, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed J.P.Seldin and J.R.Hindley, Academic Press (1980).Google Scholar
- 4.R.D.Lins, The Complexity of a translation of λ-calculus to Categorical Combinators, Computing Lab. Report N. 27 — The University of Kent at Canterbury (1985).Google Scholar
- 5.R.D.Lins, A New Way of Introducing Constants in Categorical Combinators, privately circulated, The University of Kent at Canterbury (1985).Google Scholar
- 6.R.D.Lins, On The Efficiency of Categorical Combinators as a Rewriting System, Computing Lab.Report N.34 — The University of Kent at Canterbury (1985).Google Scholar
- 7.R.D.Lins, Constants and Higher-Order Data Types in Categorical Combinators, in preparation.Google Scholar
- 8.D.Scott, Relating Theories of the Lambda-Calculus, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed. J.P.Seldin and J.R.Hindley, Academic Press (1980).Google Scholar
- 9.D.A. Turner, A New Implementation Technique for Applicative Languages, Software Practice and Experience, Vol 9, 31–49 (1979).Google Scholar