Abstract
Categorical Combinators form a formal system similar to Curry’s Combinatory Logic. It was developed by Curien [2] inspired by the equivalence of the theories of typed λ-calculus and Cartesian Closed Categories as shown by Lambek [3] and Scott [8], 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.
Author supplied keywords
Cite
CITATION STYLE
Lins, R. D. (1986). A new formula for the execution of categorical combinators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 230 LNCS, pp. 89–98). Springer Verlag. https://doi.org/10.1007/3-540-16780-3_82
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
