Abstract
Klop’s Problem is finding a type for characterizing hereditary head normalizing terms, that is, lambda-terms whose Böhm trees do not contain the bottom. This paper proves that this problem does not have any solution by showing that the set of those terms is not recursively enumerable. This paper also gives a best-possible solution by providing an intersection type system with a countably infinite set of types such that typing in all these types characterizes hereditary head normalizing terms. By using the same technique, this paper also shows that the set of lambda-terms normalizing by infinite reduction is not recursively enumerable.
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
Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic 48(4), 931–940 (1983)
Berarducci, A., Dezani-Ciancaglini, M.: Infinite lambda-calculus and Types. Theoretical Computer Science 212, 29–75 (1999)
Dezani-Ciancaglini, M., Honsell, F., Motohama, Y.: Compositional Characterization of λ-terms using Intersection Types. Theoretical Computer Science 340(3), 459–495 (2005)
Dezani-Ciancaglini, M.: Private communication (2007)
Hindley, J.R., Seldin, J.P.: Introduction to Combinators and λ-Calculus. Cambridge University Press, Cambridge (1986)
Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus. Theoretical Computer Science 175(1), 93–125 (1997)
Kurata, T.: A Type Theoretical View of Böhm-Trees. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 231–247. Springer, Heidelberg (1997)
Raffalli, C.: Data Types, Infinity and Equality in System AF2. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 280–294. Springer, Heidelberg (1994)
Tatsuta, M., Dezani-Ciancaglini, M.: Normalisation is Insensible to lambda-term Identity or Difference. In: Proceedings of Twenty First Annual IEEE Symposium on Logic in Computer Science, pp. 327–336 (2006)
Terese (Bezem, M., Klop, J.W., de Vrijer, R. (eds.)), Term Rewriting Systems, Cambridge University Press (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tatsuta, M. (2008). Types for Hereditary Head Normalizing Terms. In: Garrigue, J., Hermenegildo, M.V. (eds) Functional and Logic Programming. FLOPS 2008. Lecture Notes in Computer Science, vol 4989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78969-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-78969-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78968-0
Online ISBN: 978-3-540-78969-7
eBook Packages: Computer ScienceComputer Science (R0)