Wellfounded recursion with copatterns (Q5244799)

From MaRDI portal
Revision as of 21:19, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6421038
Language Label Description Also known as
English
Wellfounded recursion with copatterns
scientific article; zbMATH DE number 6421038

    Statements

    title
    Wellfounded recursion with copatterns (English)
    0 references
    author
    Andreas Abel
    0 references
    Brigitte Pientka
    0 references
    publication date
    30 March 2015
    0 references
    zbMATH Keywords
    coinduction
    0 references
    pattern matching
    0 references
    productivity
    0 references
    recursion
    0 references
    strong normalization
    0 references
    type-based termination
    0 references
    describes a project that uses
    Agda
    0 references
    Coq
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68N18
    0 references
    03B70
    0 references
    68P05
    0 references
    zbMATH DE Number
    6421038
    0 references
    OpenAlex ID
    W2085552917
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5244799&oldid=31945240"
    Powered by MediaWiki