Generalised folds for nested datatypes

By Richard S. Bird, Ross A. Paterson. 1999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Heterogeneous substitution systems revisited (2016, positive): “This makes use of a general fusion law for generalized iteration [13].”
Initial Semantics for Strengthened Signatures (2012, background): “The idea that the notion of monad is suited for modeling substitution concerning syntax (and semantics) has been retained by many recent contributions on the subject (see e.g. [5, 12, 16]) although some other settings have been considered.”
Under Consideration for Publication in Formal Aspects of Computing Disciplined, Efficient, Generalised Folds for Nested Datatypes (unknown): “Then we will give one more example: the generalised fold on the datatype Bush .T wo further examples are given in [ BiP99b ].”
de Bruijn notation as a nested datatype (1999, background): “More details of generalised folds and their properties may be found in a companion paper (Bird and Paterson, 1998).”
Substitution in Non-wellfounded Syntax with Variable Binding (2003, background): “The same kind of specialization of generalized iteration is carried out in [11], yielding “generalized folds”.”
Iteration and coiteration schemes for higher-order and nested datatypes (2005, methodology): “To overcome their limited usability, Bird and Paterson[11] formulatedgeneralized folds .”
Map fusion for nested datatypes in intensional type theory (2011, background): “Generalized Mendler-style iteration is a scheme encompassing generalized folds [13, 3, 17].”
Modules over Monads and Linearity (2006, background): “[2, 11, 18]) although some other settings have been considered.”