Catamorphism: a generalization of the fold function in FunctionalProgramming.

A function on finite data structures having a tree-like data type is a catamorphism if it can be computed bottom-up by replacing the constructors systematically by an evaluation function. For example, the sum of the values of a tree with numbers at the leaves is a catamorphism: replace the leaf constructor by the identity function and the join constructor by + (addition on numbers).

See also: BirdMeertensFormalism.

Revision: r1.1 - 09 May 2001 - 21:56 - EelcoVisser
Transform > CataMorphism
Copyright © 1999-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback