TYPECHECKING IS UNDECIDABLE WHEN ''TYPE'' IS A TYPE

Authors:
M. B. Reinhold
Affiliations:
-
Venue:
TYPECHECKING IS UNDECIDABLE WHEN ''TYPE'' IS A TYPE
Year:
1989

Citing 0
Cited 4

Cache performance of garbage-collected programs

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An Introduction to Dependent Type Theory

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Remarks on the equational theory of non-normalizing pure type systems

Journal of Functional Programming
Typed self-representation

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A function has a dependent type when the type of its result depends upon the value of its argument. The type of all types is the type of every type, including itself. In a typed l-calculus, these two features synergize in a conceptually clean and uniform way to yield enormous expressive power at very little apparent cost. By reconstructing and analyzing a paradox due to Girard, we argue that there is no effective typechecking algorithm for such a language.