On the Computational Complexity of Program Scheme Equivalence (Q3893301)

From MaRDI portal
Revision as of 14:31, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    On the Computational Complexity of Program Scheme Equivalence (English)
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    program scheme equivalence
    0 references
    decidable problems
    0 references
    programming languages
    0 references
    recursion scheme
    0 references
    author
    Harry B. III Hunt
    0 references
    Robert L. Constable
    0 references
    Sartaj K. Sahni
    0 references

    Identifiers

    DOI
    10.1137/0209031
    0 references
    zbMATH DE Number
    3700202
    0 references
    OpenAlex ID
    W1963980186
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3893301&oldid=31183880"
    Powered by MediaWiki