Unifying structured recursion schemes (Q5371980): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Categorical fixed point calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised coinduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised folds for nested datatypes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive coalgebras from comonads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjoint functors and triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic downwards accumulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the unique fixed-point principle correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying structured recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Hylomorphisms -- Or / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy theory in general categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjoint Functors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Standard Construction is Induced by a Pair of Adjoint Functors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixpoint theorem for complete categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and program transformation / 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: Paramorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive types and type constraints in the second-order lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4816998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comonadic Notions of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recursion Scheme from the Cofree Recursive Comonad / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718773 / rank
 
Normal rank

Latest revision as of 14:19, 14 July 2024

scientific article; zbMATH DE number 6796927
Language Label Description Also known as
English
Unifying structured recursion schemes
scientific article; zbMATH DE number 6796927

    Statements

    Unifying structured recursion schemes (English)
    0 references
    0 references
    0 references
    23 October 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references