A property which guarantees termination in weak combinatory logic and subtree replacement systems (Q754175)

From MaRDI portal
Revision as of 06:04, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1981
    0 references
    termination in weak combinatory logic
    0 references
    subtree replacement systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references