A short proof of the decidability of normalization in recursive program schemes (Q5015097)
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: A short proof of the decidability of normalization in recursive program schemes |
scientific article; zbMATH DE number 7441502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of the decidability of normalization in recursive program schemes |
scientific article; zbMATH DE number 7441502 |
Statements
8 December 2021
0 references
0.7617525458335876
0 references
0.7197530269622803
0 references
0.7108091711997986
0 references
