Abstract
The paper presents the connection between λ-calculus and cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical combinatory logic and λ-calculus with explicit products and projections, with β and þ-rules as well as with surjective pairing. “Combinatory logic“ is of course inspired by Curry's combinatory logic, based on the well known S,K,I. Compiling λ-calculus happens to be natural and provokes only n log n code expansion (which is achieved only with infinitely many S,K-like combinators). Moreover categorical combinatory logic is entirely faithful to β-reduction where combinatory logic needs additional rather complex and unnatural axioms to be. The paper is intended as a mathematical foundation for developing implementations of functional programming languages based on a “categorical abstract machine”, as developed in forthcoming papers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
H. Barendregt, The Lambda Calculus: its Syntax and Semantics, North Holland (1981).
H. Barendregt, Pairing without Conventional Constraints, Z. Math. Logik Grundlag. Math. 20, 289–306 (1974).
G. Berry, Some Syntactic and Categorical Constructions of Lambda-calculus models, Rapport INRIA 80 (1981).
N.G. De Bruijn, Lambda-calculus Notation without Nameless Dummies, a Tool for Automatic Formula Manipulation, Indag Math. 34, 381–392 (1972).
G. Cousineau, P-L. Curien, M. Mauny, The Categorical Abstract Machine, Rapport LITP 85-8, Université Paris VII, January 1985.
P-L. Curien, Combinateurs Catégoriques, Algorithmes Séquentiels et Programmation Applicative, Thèse d'Etat, Université Paris VII (Décembre 83), to be published in english as a monograph.
P-L. Curien, Typed Categorical Combinatory Logic, CAAP 85 (Berlin).
Syntactic Equivalences Inducing Semantic Equivalences, EUROCAL 1985 (Linz).
H.B. Curry, R. Feys, Combinatory Logic, Vol.1, North Holland (1958).
G. Huet, D. Oppen, Equations and Rewrite Rules: a Survey, in Formal Language Theory: Perspectives and Open Problems, R. Book Ed., Academic Press, 349–405 (1980).
J.R. Kennaway, M.R. Sleep, Combinator Strings, internal report of the University of East Anglia (1982).
J.W. Klop, Combinatory Reduction Systems, PhD Thesis, Utrecht (1980).
J. Lambek and P. Scott, Introduction to Higher Order Categorical Logic, to be published by Cambridge University Press (1984).
P.J. Landin, The Mechanical Evaluation of Expressions, Computer Journal 6, 308–320 (1964).
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).
D.A. Turner, A New Implementation Technique for Applicative Languages, Software Practice and Experience, Vol.9, 31–49 (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Curien, P.L. (1985). Categorical combinatory logic. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015738
Download citation
DOI: https://doi.org/10.1007/BFb0015738
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive