Typability and type checking in System F are equivalent and undecidable (Q1302292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Typability and type checking in System F are equivalent and undecidable |
scientific article; zbMATH DE number 1340811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Typability and type checking in System F are equivalent and undecidable |
scientific article; zbMATH DE number 1340811 |
Statements
Typability and type checking in System F are equivalent and undecidable (English)
0 references
22 September 1999
0 references
type inference
0 references
System F
0 references
second-order polymorphically typed lambda calculus
0 references
typability
0 references
type checking
0 references
decidability
0 references
semi-unification
0 references
0 references
0.868330180644989
0 references
0.8523758053779602
0 references
0.8369743227958679
0 references
0.8331562876701355
0 references
