Typability and Type Checking in the Second-Order Lambda-Calculus Are Equivalent and Undecidable¶

Wells, J. B. (1994). Typability and Type Checking in the Second-Order Lambda-Calculus Are Equivalent and Undecidable. Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS), 176-185.

Type: Conference paper
Intellectual base: Primary research
Year: 1994
Pages: 176-185
DOI: 10.1109/lics.1994.316068
DOI registrant: Institute of Electrical and Electronics Engineers
Link: https://doi.org/10.1109/LICS.1994.316068
Cited from: computer_science

Cited by¶

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes¶

Computability
- word problems in finitely presented groups; provability predicates. Computer science. Verification limits via Rice's theorem (no algorithm decides non-trivial semantic properties of arbitrary programs); undecidable type systems
  This sourceProves type inference for System F (second-order lambda calculus) undecidable, an instance of undecidable type systems.

Verification¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:62316c3d272d · see in the full table