Abstract
Functional languages are based on the notion of application: programs may be applied to data or programs. By application one may define algebraic functions and a programming language is functionally complete when any algebraic function f(x1,...,xn) is representable (i.e. there is a constant a such that f(x1,...,xn) = ax1· ... ·xn). Combinatory Logic (C.L.) is the simplest type-free language which is functionally complete.
In a sound category-theoretic framework the constant a above may be considered an "abstract gödel-number" for f, as gödel-numberings are generalized to "principal morphisms". By this, models of C.L. are categorically characterized and their relation is given to λ-calculus models within Cartesian Closed Categories.
Finally, the partial recursive functionals in any finite higher type are shown to yield models of C.L..
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barendregt H. (1983) "Lambda-calculus and its models" in Proceedings of Logic Colloquium 82 (Lolli, Longo, Marcja eds), North-Holland.
Barendregt H. (1984) The lambda-calculus: its syntax and semantics, revised and expanded edition, North-Holland.
Berry G. (1979) "Some Syntactic and Categorial Constructions of λ-calculus models" INRIA, Valbonne.
Hindley R., Longo G. (1980) "Lambda-calculus models and extensionality" Zeit. Math. Logik 26 (289–310).
Hindley R., Seldin J. (198?) Introductory book on lambda-calculus and CL (in preparation).
Longo G. (1982) "Hereditary Partial Effective Functionals in any finite type" (Preliminary note), Forschungsinst. Math. ETH, Zürich.
Longo, G., Moggi E. (1983) "The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types" J. Symb. Logic (to appear).
Longo G., Moggi E. (1984) "Carlesian Closed Categories for effective type structures" Part I Symp. Semantics Data Types, LNCS, Springer-Verlag (to appear).
Meyer A. (1982) "What is a model of lambda-calculus?" Info. Contr. 52, 1 (87–122).
Plotkin G. (1978) "Tω as a universal domains" JCSS 17, 2 (209–236).
Scott D.S. (1980) "Relating theories of lambda-calculus" in To H.B. Curry: essays... (Hindley, Seldin eds.), Academic Press (403–450).
Scott D.S. (1982) "Some ordered sets in Computer Science" Ordered sets (Rival ed.), Reidel.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Longo, G., Moggi, E. (1984). Gödel numberings, principal morphisms, combinatory algebras. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030322
Download citation
DOI: https://doi.org/10.1007/BFb0030322
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive