A property which guarantees termination in weak combinatory logic and subtree replacement systems (Q754175): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:25, 30 January 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