Article

The Undecidability of Typability in the Lambda-Pi-Calculus

Author:

Gilles DowekAuthors Info & Claims

TLCA '93: Proceedings of the International Conference on Typed Lambda Calculi and Applications

Pages 139 - 145

Published: 16 March 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Spies SForster YBlanchette JHriţcu C(2020)Undecidability of higher-order unification formalised in CoqProceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3372885.3373832(143-157)Online publication date: 20-Jan-2020
https://dl.acm.org/doi/10.1145/3372885.3373832
Farka F(2020)slepice: Towards a Verified Implementation of Type Theory in Type TheoryLogic-Based Program Synthesis and Transformation10.1007/978-3-030-68446-4_7(133-150)Online publication date: 7-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-68446-4_7
Valliappan NHughes JChechina NFrancalanza A(2018)Typing the wild in ErlangProceedings of the 17th ACM SIGPLAN International Workshop on Erlang10.1145/3239332.3242766(49-60)Online publication date: 29-Sep-2018
https://dl.acm.org/doi/10.1145/3239332.3242766
Show More Cited By

Index Terms

The Undecidability of Typability in the Lambda-Pi-Calculus
1. Mathematics of computing
  1. Discrete mathematics

Index terms have been assigned to the content through auto-classification.

Recommendations

Type checking and typability in domain-free lambda calculi

This paper shows (1) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with negation, product, and existential types, (2) the undecidability of the typability problem in the domain-free polymorphic ...
Label dependent lambda calculus and gradual typing

Dependently-typed programming languages are gaining importance, because they can guarantee a wide range of properties at compile time. Their use in practice is often hampered because programmers have to provide very precise types. Gradual typing is a ...
Typability is Undecidable for F+Eta

Comments

Information & Contributors

Information

Published In

TLCA '93: Proceedings of the International Conference on Typed Lambda Calculi and Applications

March 1993

432 pages

ISBN:3540565175

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 16 March 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Spies SForster YBlanchette JHriţcu C(2020)Undecidability of higher-order unification formalised in CoqProceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3372885.3373832(143-157)Online publication date: 20-Jan-2020
https://dl.acm.org/doi/10.1145/3372885.3373832
Farka F(2020)slepice: Towards a Verified Implementation of Type Theory in Type TheoryLogic-Based Program Synthesis and Transformation10.1007/978-3-030-68446-4_7(133-150)Online publication date: 7-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-68446-4_7
Valliappan NHughes JChechina NFrancalanza A(2018)Typing the wild in ErlangProceedings of the 17th ACM SIGPLAN International Workshop on Erlang10.1145/3239332.3242766(49-60)Online publication date: 29-Sep-2018
https://dl.acm.org/doi/10.1145/3239332.3242766
Barendregt HGeuvers H(2001)Proof-assistants using dependent type systemsHandbook of automated reasoning10.5555/778522.778527(1149-1238)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778527
Pfenning F(2001)Logical frameworksHandbook of automated reasoning10.5555/778522.778526(1063-1147)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778526
Dowek G(2001)Higher-order unification and matchingHandbook of automated reasoning10.5555/778522.778525(1009-1062)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778525

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Type checking and typability in domain-free lambda calculi

Label dependent lambda calculus and gradual typing

Typability is Undecidable for F+Eta

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations