On the Computational Complexity of Program Scheme Equivalence (Q3893301)

From MaRDI portal
Revision as of 10:00, 20 October 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
On the Computational Complexity of Program Scheme Equivalence
scientific article

    Statements

    On the Computational Complexity of Program Scheme Equivalence (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    program scheme equivalence
    0 references
    decidable problems
    0 references
    programming languages
    0 references
    recursion scheme
    0 references

    Identifiers