Abstract
The question whether a given functional of a full type structure (FTS for short) is λ-definable by a closed λ-term, raised by G. Huet in [Hue75] and known as the Definability Problem, was proved to be undecidable by R. Loader in 1993. More precisely, R. Loader proved that the problem is undecidable for every FTS over at least 7 ground elements (cf [Loa01]).
We solve here the remaining non trivial cases and show that the problem is undecidable whenever there are more than one ground element. The proof is based on a direct encoding of the Halting Problem for register machines into the Definability Problem restricted to the functionals of the Monster type \( \mathbb{M} \) = (((o→o)→o)→o)→(o→o). It follows that this new restriction of the Definability Problem, which is orthogonal to the ones considered so far, is also undecidable. Another consequence of the latter fact, besides the result stated above, is the undecidability of the β-Pattern Matching Problem, recently established by R. Loader in [Loa03].
The present work was done at the University of Nijmegen, The Netherlands.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. 6th Annual IEEE Symposium on Logic in Computer Science, 203–211, 1991.
Harvey Friedman. Equality between functionals. LNM, 453:22–37, 1975.
Gérard Huet. A unification algorithm for typed λ-calculus. TCS, 1(1):27–57, 1975.
Thierry Joly. Codages, séparabilité et représentation de fonctions en λ-calcul simplement typé et dans d’autres systèmes de types. Thèse de Doctorat, Université Paris VII, January 2000.
Thierry Joly. Constant time parallel computations in λ-calculus. TCS, 266:975–985, 2001.
Thierry Joly. The finitely generated types of the λ-calculus. LNCS, 2044:240–252, 2001. (proc. TLCA’01).
Ralph Loader. The Undecidability of λ-Definability. In Logic, Meaning and Computation: Essays in Memory of Alonzo Church, 331–342, C.A. Anderson and M. Zelëny editors, Kluwer Academic Publishers, Dordrecht, 2001.
Ralph Loader. Higher β matching is undecidable. Logic Journal of the IGPL, Vol. 11, No. 1:51–68, 2003.
Peter Selinger. Order-Incompleteness and Finite Lambda Models. 11th Annual IEEE Symposium on Logic in Computer Science, 432–439, 1996.
Richard Statman. Completeness, invariance and λ-definability. JSL, 47:17–26, 1982.
Richard Statman. Logical Relations and the Typed λ-calculus. IC, 65:85–97, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joly, T. (2003). Encoding of the Halting Problem into the Monster Type and Applications. In: Hofmann, M. (eds) Typed Lambda Calculi and Applications. TLCA 2003. Lecture Notes in Computer Science, vol 2701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44904-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-44904-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40332-6
Online ISBN: 978-3-540-44904-1
eBook Packages: Springer Book Archive