Generalised folds for nested datatypes

DOI10.1007/S001650050047MaRDI QIDQ1965249zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

program constructionnested datatypes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Disciplined, efficient, generalised folds for nested datatypes
• scientific article; zbMATH DE number 1956505
• scientific article; zbMATH DE number 1375587
• A principled approach to programming with nested types in Haskell
• Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening

Cited in

(24)

• Fantastic morphisms and where to find them. A guide to recursion schemes
• Structured handling of scoped effects
• Parametricity for primitive nested types
• Type Fusion
• Map fusion for nested datatypes in intensional type theory
• scientific article; zbMATH DE number 1956505 (Why is no real title available?)
• scientific article; zbMATH DE number 1375587 (Why is no real title available?)
• From signatures to monads in \textsf{UniMath}
• Disciplined, efficient, generalised folds for nested datatypes
• scientific article; zbMATH DE number 7779291 (Why is no real title available?)
• Containers: Constructing strictly positive types
• scientific article; zbMATH DE number 7379288 (Why is no real title available?)
• High-level signatures and initial semantics
• Iteration and coiteration schemes for higher-order and nested datatypes
• A principled approach to programming with nested types in Haskell
• Towards an induction principle for nested data types
• scientific article; zbMATH DE number 7471683 (Why is no real title available?)
• On the semantics of nested datatypes
• Heterogeneous substitution systems revisited
• Substitution in non-wellfounded syntax with variable binding
• Coroutining folds with hyperfunctions
• Explicit substitutions and higher-order syntax
• Unifying structured recursion schemes. An extended study
• An induction principle for nested datatypes in intensional type theory

This page was built for publication: Generalised folds for nested datatypes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1965249)