The complexity of type inference for higher-order typed lambda calculi (Q4764610)
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: The complexity of type inference for higher-order typed lambda calculi |
scientific article; zbMATH DE number 751115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of type inference for higher-order typed lambda calculi |
scientific article; zbMATH DE number 751115 |
Statements
The complexity of type inference for higher-order typed lambda calculi (English)
0 references
13 December 1995
0 references
complexity of type inference
0 references
decidability of type inference
0 references
second order polymorphic typed \(\lambda\)-calculus
0 references
lower bounds
0 references
higher-order extensions
0 references
encoding of Turing machines by types
0 references
0.8247668147087097
0 references
0.8046508431434631
0 references
