A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6576636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization |
scientific article; zbMATH DE number 6576636 |
Statements
A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (English)
0 references
3 May 2016
0 references
implicit computational complexity
0 references
lambda-calculus
0 references
type assignment systems
0 references
stratified types
0 references
polynomial time
0 references
0.7977266311645508
0 references
0.7712791562080383
0 references
0.7712715268135071
0 references
0.7702891230583191
0 references
0.7698147296905518
0 references
