Some Wellfounded Trees in UniMath (Q2819193): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UniMath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: cubicaltt / 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.1007/978-3-319-42432-3_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2475593741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-wellfounded trees in Homotopy Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univalent categories and the Rezk completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Types in Homotopy Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2968413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: de Bruijn notation as a nested datatype / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubical Type Theory: a constructive interpretation of the univalence axiom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution in non-wellfounded syntax with variable binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental library of formalized Mathematics based on the univalent foundations / rank
 
Normal rank

Latest revision as of 15:45, 12 July 2024

scientific article
Language Label Description Also known as
English
Some Wellfounded Trees in UniMath
scientific article

    Statements

    Some Wellfounded Trees in UniMath (English)
    0 references
    0 references
    0 references
    28 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    proof assistant
    0 references
    univalent type theory
    0 references
    inductive datatypes
    0 references
    UniMath
    0 references
    initial algebras
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references