The complexity of type inference for higher-order typed lambda calculi (Q4764610): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:18, 7 February 2024
scientific article; zbMATH DE number 751115
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
