Abstract
Ordinary and polymorphic typed lambda calculi are constructed as initial algebras for suitable endofunctors. The semantics is realized as the unique morphism from the initial algebra to an appropriate semantic algebra. In the case of the polymorphic lambda calculus, this semantic algebra is constructed from the category bPER* of pointed partial equivalence relations.
This work was partially supported by the National Science Foundation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
5. References
K.B. Bruce and G. Longo, A modest model of records, inheritance and bounded quantification, in Logic in Computer Science, Proceedings Third Annual Symposium, Edinburgh, Scotland, 1988, Computer Society Press, Washington, D. C., 38–50.
H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1, Springer-Verlag, New York, 1985.
J W. Gray, A categorical treatment of polymorphic operations, in Mathematical Foundations of Programming Language Semantics, M. Main, A Melton, M. Mislove and D. Schmidt, Eds., 3rd Workshop, New Orleans 1987, Lecture Notes in Computer Science 298, Springer-Verlag, New York, 1987., 2–22.
J. W. Gray, The Integration of Logical and Algebraic Types, Proc. Int. Workshop on Categorical Mathods in Computer Science with Aspects from Topology, Lecture Notes in Computer Science, Springer-Verlag, New York, 1989, to appear.
C. A. Gunter, P. D. Mosses, and D. S. Scott, Semantic domains and denotational semantics, in Handbook of Theoretical Computer Science, North Holland, to appear.
J. M. E. Hyland, The effective topos, in The L.E.J. Brouwer Centenary Symposium, A. S. Troelstra and D. van Dalen, Eds., North-Holland, Amsterdam, 1982.
J. M. E. Hyland, <completeness properties>
J. Lambek, A fixpoint theorem for complete categories, Math. Zeitschr. 103 (1968), 151–161.
J. Lambek and P. Scott, Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7, Cambridge University Press, New York, 1986.
G. Longo and E. Moggi, Constructive natural deduction and its ‘Modest’ interpretation, in Semantics of Natural and Computer Languages, J. Meseguer et al, Eds., M. I. T. Press, Cambridge, MA, 1989.
E. Manes and M. Arbib, Algebraic Approaches to Program Semantics, Springer-Verlag, New York, 1986.
F. Oles, A category-theoretic approach to the semantics of programming languages, Thesis, Syracuse University, 1982.
F. Oles, Lambda Calculi with implicit type conversions
J. C. Reynolds, Towards a theory of type structures, in Colloque sur la Programmation, Lecture Notes in Computer Science 19, Springer-Verlag 1974, 408–425.
J. C. Reynolds, Types, abstraction, and parametric polymorphism, IFIP 83, Paris.
J. C. Reynolds, Polymorphism is not set-theoretic, in [LNCS 173], 145–156.
J. C. Reynolds, Three approaches to type structure. In TYPSOFT advanced seminar on the role of semantics in software development, Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gray, J.W. (1990). Initial algebra semantics for lambda calculi. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040272
Download citation
DOI: https://doi.org/10.1007/BFb0040272
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97375-3
Online ISBN: 978-0-387-34808-7
eBook Packages: Springer Book Archive