Disciplined, efficient, generalised folds for nested datatypes

DOI10.1007/s00165-003-0013-6zbMath1084.68075OpenAlexW2040687117MaRDI QIDQ1882785

Ian Bayley, Jeremy Gibbons, Clare E. Martin

Publication date: 1 October 2004

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-003-0013-6

zbMATH Keywords

FoldFunctor categoryPolymorphic recursionNested datatypeNon-regular datatypeNon-uniform datatypeUniversal property

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (6)

A principled approach to programming with nested types in Haskell ⋮ Map fusion for nested datatypes in intensional type theory ⋮ Unnamed Item ⋮ Iteration and coiteration schemes for higher-order and nested datatypes ⋮ An induction principle for nested datatypes in intensional type theory ⋮ Heterogeneous Substitution Systems Revisited

This page was built for publication: Disciplined, efficient, generalised folds for nested datatypes