A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2396664939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Containers: Constructing strictly positive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copatterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtyping, Declaratively / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Coinduction in Coq Using Bisimulation-Up-To Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoCaml: Functional Programming with Regular Coinductive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3578287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequential machine maps / rank
 
Normal rank

Latest revision as of 18:01, 10 July 2024

scientific article
Language Label Description Also known as
English
A Mechanized Theory of Regular Trees in Dependent Type Theory
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references