A property which guarantees termination in weak combinatory logic and subtree replacement systems (Q754175): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1305/ndjfl/1093883514 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093883514 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965871469 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1305/NDJFL/1093883514 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:03, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A property which guarantees termination in weak combinatory logic and subtree replacement systems |
scientific article |
Statements
A property which guarantees termination in weak combinatory logic and subtree replacement systems (English)
0 references
1981
0 references
termination in weak combinatory logic
0 references
subtree replacement systems
0 references
