Implicit computation complexity in higher-order programming languages (Q5875893)
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: Implicit computation complexity in higher-order programming languages |
scientific article; zbMATH DE number 7650541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit computation complexity in higher-order programming languages |
scientific article; zbMATH DE number 7650541 |
Statements
Implicit computation complexity in higher-order programming languages (English)
0 references
6 February 2023
0 references
lambda calculus
0 references
linear logic
0 references
type systems
0 references
computational complexity
0 references
0 references
0 references
0 references
0.88665664
0 references
0.87504685
0 references
0.86874187
0 references
0 references
0 references
0.86360717
0 references
0.85749304
0 references
