LEAN: An intermediate language based on graph rewriting (Q1823673)

From MaRDI portal
Revision as of 05:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
LEAN: An intermediate language based on graph rewriting
scientific article

    Statements

    title
    LEAN: An intermediate language based on graph rewriting (English)
    0 references
    author
    H. P. Barendregt
    0 references
    M. J. Plasmeijer
    0 references
    J. R. W. Glauert
    0 references
    J. R. Kennaway
    0 references
    M. R. Sleep
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    68N99
    0 references
    03D03
    0 references
    68N01
    0 references
    68Q65
    0 references
    zbMATH DE Number
    4115943
    0 references
    zbMATH Keywords
    generalized graph rewriting
    0 references
    computational models
    0 references
    LEAN
    0 references
    Term Rewriting Systems
    0 references
    functional programming
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1823673&oldid=26514509"
    Powered by MediaWiki