Abstract
In this paper we prove the decidability of the existence of a definable retraction between two given simple types. Instead of defining some extension of a former type system from which these retractions could be inferred, we obtain this result as a corollary of the decidability of the minimal model of simply typed λ-calculus.
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.
References
Bruce, K., Longo, G. (1985) Provable isomorphims and domain equations in models of typed languages. A.C.M. Symposium on Theory of Computing (STOC 85).
Dezani-Ciancaglini, M. (1976) Characterization of normal forms possessing inverse in the λβη-calculus. TCS 2.
de’Liguoro, U., Piperno, A., Statman, R. (1992) Retracts in simply typed λβη-calculus. Proceeding of the 7th annual IEEE symposium on Logic in Computer Science (LICS92), IEEE Computer Society Press.
Loader, R. (1997) An Algorithm for the Minimal Model. Manuscript. Available at http://www.dcs.ed.ac.uk/home/loader/.
Padovani, V. (1995) Decidability of all minimal models. Proceedings of the annual meeting Types for Proof and Programs — Torino 1995, Lecture Notes in Computer Science 1158, Springer-Verlag.
Schmidt-Schauβ, M. (1998) Decidability of Behavioral Equivalence in Unary PCF. Theorical Computer Science 216.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Padovani, V. (2001). Retracts in Simple Types. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-45413-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41960-0
Online ISBN: 978-3-540-45413-7
eBook Packages: Springer Book Archive