Abstract
Order-enriched sketches are constructed for which the initial algebras are respectively, the simple typed λ-calculus, the PCF version of the λ-calculus, and the polymorphic typed λ-calculus.
This research was partially supported by the National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
7 References
M. Barr and C. Wells, Categories for Computer Scientists, Prentice Hall, 1990.
C. Ehresmann, Esquisses et types de structures algébriques, Bull. Instit. Polit., Iasi XIV (1968), 1–14.
P. Gabriel and F. Ulmer, Lokal Präsentierbare Kategorien, Lecture Notes in Math., 221, Springer-Verlag, New York, 1971.
J.-Y. Girard, Une extension de l'interpretation de Gödel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, North-Holland Pub. Co., Amsterdam, London, 1971, 63–92.
J.-Y. Girard, Proofs and Types, Translated and with appendices by P. Taylor and Y. Lafont, Cambridge University Press, Cambridge, 1989.
J. W. Gray, Formal Category Theory: Adjointness for 2-Categories, Lecture Notes in Mathematics 391, Springer-Verlag, New York, 1974
J. W. Gray, The Category of Sketches as a model for Algebraic Semantics, in Categories in Computer Science and Logic, J. W. Gray and A. Scedrov, Eds., Contemporary Mathematics 92, Amer. Math. Soc., Providence, R. I., 1989, 109–135.
J. W. Gray, The Integration of Logical and Algebraic Types, in Categorical Methods in Computer Science with Aspects from Topology, H. Ehrig et al., Eds., Lecture Notes in Computer Science 393, Springer-Verlag, New York, 1989, 16–35.
J. W. Gray, Executable specifications for data type constructors, in preparation.
J. W. Gray, PCF in Mathematica, in preparation.
J. W. Gray, Poly Lambda in Mathematica, in preparation.
G. M. Kelly and R. Street, Sydney Category Theory Seminar, Lecture Notes in Mathematics 420, Springer-Verlag, New York, 1974.
M. Makkai and R. Pare, Accessible Categories: The foundations of Categorical Model Theory, Contemporary Mathematics 104, Amer. Math. Soc., Providence RI, 1989.
B. Pierce, S. Dietzen, S. Michaylov, Programming in higher-order typed lambda-calculi, Technical Report CMU-CS-89-111, Carnegie Mellon University.
G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science 5 (1977), 223–255.
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.
A. Stouten, Substitution Revisited, Theoretical Computer Science 59 (1988), 317–325.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag
About this paper
Cite this paper
Gray, J.W. (1991). Order-enriched sketches for typed lambda calculi.. In: Carboni, A., Pedicchio, M.C., Rosolini, G. (eds) Category Theory. Lecture Notes in Mathematics, vol 1488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0084216
Download citation
DOI: https://doi.org/10.1007/BFb0084216
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54706-8
Online ISBN: 978-3-540-46435-8
eBook Packages: Springer Book Archive