Abstract
In this chapter we characterize the isomorphisms which hold in all models of λ1 βηπ✻ the simply typed lambda calculus with subjective pairing (and “terminal object”). Moreover, we show that it is decidable whether two types (built from type variables) are isomorphic in all models of this calculus. It is well known that these models are exactly the Cartesian Closed Categories (ccc).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Birkhäuser Boston
About this chapter
Cite this chapter
Di Cosmo, R. (1995). First-Order Isomorphic Types. In: Isomorphisms of Types. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-2572-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2572-0_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7585-5
Online ISBN: 978-1-4612-2572-0
eBook Packages: Springer Book Archive