The Complexity of the Diagonal Problem for Recursion Schemes (Q5136337)
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 the Diagonal Problem for Recursion Schemes |
scientific article; zbMATH DE number 7278117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of the Diagonal Problem for Recursion Schemes |
scientific article; zbMATH DE number 7278117 |
Statements
25 November 2020
0 references
diagonal problem
0 references
higher-order recursion schemes
0 references
intersection types
0 references
downward closure
0 references
The Complexity of the Diagonal Problem for Recursion Schemes (English)
0 references
0.91167295
0 references
0 references
0 references
0.89548856
0 references
0.8878705
0 references
0.86280644
0 references
0.86096084
0 references
