Generalised folds for nested datatypes
From MaRDI portal
Publication:1965249
DOI10.1007/s001650050047zbMath0937.68027OpenAlexW2151015971MaRDI QIDQ1965249
Ross Paterson, Richard S. Bird
Publication date: 6 February 2000
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:0c60214a-4238-4323-92ee-4c26fea8a32a
Related Items
A principled approach to programming with nested types in Haskell, Explicit substitutions and higher-order syntax, Map fusion for nested datatypes in intensional type theory, Fantastic morphisms and where to find them. A guide to recursion schemes, Structured handling of scoped effects, Towards an induction principle for nested data types, Unnamed Item, Unifying structured recursion schemes, Unnamed Item, Unnamed Item, Parametricity for primitive nested types, Substitution in non-wellfounded syntax with variable binding, Iteration and coiteration schemes for higher-order and nested datatypes, Type Fusion, High-level signatures and initial semantics, An induction principle for nested datatypes in intensional type theory, From signatures to monads in \textsf{UniMath}, Heterogeneous Substitution Systems Revisited, Containers: Constructing strictly positive types, On the semantics of nested datatypes
