Abstract
This paper concerns retracts in simply typed lambda calculus assuming βη-equality. We provide a simple tableau proof system which characterises when a type is a retract of another type and which leads to an exponential decision procedure.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 118–309. Oxford University Press (1992)
Bruce, K., Longo, G.: Provable isomorphisms and domain equations in models of typed languages. In: Proc. 17th Symposium on Theory of Computing, pp. 263–272. ACM (1985)
de ’Liguoro, U., Piperno, A., Statman, R.: Retracts in simply typed λβη-calculus. In: Procs. LICS 1992, pp. 461–469 (1992)
Loader, R.: Higher-order β-matching is undecidable. Logic Journal of the IGPL 11(1), 51–68 (2003)
Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs. LICS 2006, pp. 81–90 (2006)
Ong, C.-H.L., Tzevelekos, N.: Functional Reachability. In: Procs. LICS 2009, pp. 286–295 (2009)
Padovani, V.: Decidability of fourth-order matching. Mathematical Structures in Computer Science 10(3), 361–372 (2000)
Padovani, V.: Retracts in simple types. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 376–384. Springer, Heidelberg (2001)
Regnier, L., Urzyczyn, P.: Retractions of types with many atoms, pp. 1–16 (2005), http://arxiv.org/abs/cs/0212005
Schubert, A.: On the building of affine retractions. Math. Struct. in Comp. Science 18, 753–793 (2008)
Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326–335 (2007)
Stirling, C.: Dependency tree automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 92–106. Springer, Heidelberg (2009)
Stirling, C.: Decidability of higher-order matching. Logical Methods in Computer Science 5(3:2), 1–52 (2009)
Stirling, C.: An introduction to decidability of higher-order matching (2012) (Submitted for Publication), Availble at author’s website
Vorobyov, S.: The “hardest” natural decidable theory. In: Procs. LICS 1997, pp. 294–305 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stirling, C. (2013). Proof Systems for Retracts in Simply Typed Lambda Calculus. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39212-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-39212-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39211-5
Online ISBN: 978-3-642-39212-2
eBook Packages: Computer ScienceComputer Science (R0)