Combining linear logic and size types for implicit complexity (Q5079730)
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: Combining linear logic and size types for implicit complexity |
scientific article; zbMATH DE number 7533334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining linear logic and size types for implicit complexity |
scientific article; zbMATH DE number 7533334 |
Statements
28 May 2022
0 references
implicit computational complexity
0 references
\(\lambda\)-calculus
0 references
linear logic
0 references
type systems
0 references
polynomial time complexity
0 references
size types
0 references
0 references
0 references
0 references
0.9715917110443116
0 references
0.8037025332450867
0 references
0.7902907133102417
0 references
0.7797927856445312
0 references
0.7785037159919739
0 references
