Abstract
The set of pure terms which are typable in the λII-calculus in a given context is not recursive. So there is no general type inference algorithm for the programming language Elf and, in some cases, some type information has to be mentioned by the programmer.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Barendregt, Introduction to Generalized Type Systems, Journal of Functional Programming 1, 2 (1991) 125–154.
Th. Coquand, An Algorithm for Testing Conversion in Type Theory, Logical Frameworks, G. Huet and G. Plotkin (Eds.), Cambridge University Press (1991).
L. Damas, R. Milner, Principal Type-Scheme for Functional Programs, Proceedings of Principles of Programming Languages (1982).
G. Dowek, L'Indécidabilité du Filtrage du Troisième Ordre dans les Calculs avec Types Dépendants ou Constructeurs de Types (The Undecidability of Third Order Pattern Matching in Calculi with Dependent Types or Type Constructors), Comptes Rendus à l'Académie des Sciences I, 312, 12 (1991) 951–956.
G. Dowek, Third Order Matching is Decidable, Proceedings of Logic in Computer Science (1992) 2–10.
H. Geuvers, The Church-Rosser Property for βη-reduction in Typed Lambda Calculi, Proceedings of Logic in Computer Science (1992) 453–460.
W.D. Goldfarb, The Undecidability of the Second-Order Unification Problem, Theoretical Computer Science 13 (1981) 225–230.
R. Harper, F. Honsell, G. Plotkin, A Framework for Defining Logics, Proceedings of Logic in Computer Science (1987) 194–204.
G. Huet, The Undecidability of Unification in Third Order Logic, Information and Control 22 (1973) 257–267.
G. Huet, A Unification Algorithm for Typed λ-calculus, Theoretical Computer Science 1 (1975) 27–57.
G. Huet, Résolution d'Équations dans les Langages d'Ordre 1, 2, ..., ω, Thèse de Doctorat d'État, Université de Paris VII (1976).
G. Huet, B. Lang, Proving and Applying Program Transformations Expressed with Second Order Patterns, Acta Informatica 11 (1978) 31–55.
F. Pfenning, Logic Programming in the LF Logical Framework, Logical Frameworks, G. Huet and G. Plotkin (Eds.), Cambridge University Press (1991).
E. L. Post, A Variant of a Recursively Unsolvable Problem, Bulletin of American Mathematical Society 52 (1946) 264–268.
A. Salvesen, The Church-Rosser Theorem for Pure Type Systems with βη-reduction, Manuscript, University of Edinburgh (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dowek, G. (1993). The undecidability of typability in the Lambda-Pi-calculus. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037103
Download citation
DOI: https://doi.org/10.1007/BFb0037103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56517-8
Online ISBN: 978-3-540-47586-6
eBook Packages: Springer Book Archive