Computing with Free Algebras
Paul Tarau · 2012
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. Implementations using GHC's "view" construct are discussed, based on the free algebra of rooted ordered binary trees.