Wellfounded recursion with copatterns (Q5244799): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Agda / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2500365.2500591 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085552917 / rank
 
Normal rank

Latest revision as of 21:19, 19 March 2024

scientific article; zbMATH DE number 6421038
Language Label Description Also known as
English
Wellfounded recursion with copatterns
scientific article; zbMATH DE number 6421038

    Statements

    Wellfounded recursion with copatterns (English)
    0 references
    0 references
    0 references
    30 March 2015
    0 references
    coinduction
    0 references
    pattern matching
    0 references
    productivity
    0 references
    recursion
    0 references
    strong normalization
    0 references
    type-based termination
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references