Free Monoids and Computing
The free monoid on a set A corresponds to lists of elements from A with concatenation as the binary operation. A monoid homomorphism from the free monoid to any other monoid (M,•) is a function f such that
- f(x1…xn) = f(x1) • … • f(xn)
- f = e
where e is the identity on M. Computationally, every such homomorphism corresponds to a map operation applying f to all the elements of a list, followed by a fold operation which combines the results using the binary operator •. This computational paradigm (which can be generalised to non-associative binary operators) has inspired the MapReduce software framework.
Read more about this topic: Free Monoid
Famous quotes containing the word free:
“Do we call this the land of the free? What is it to be free from King George and continue the slaves of King Prejudice? What is it to be born free and not to live free? What is the value of any political freedom, but as a means to moral freedom? Is it a freedom to be slaves, or a freedom to be free, of which we boast?”
—Henry David Thoreau (1817–1862)