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:
“I wish more and more that health were studied half as much as disease is. Why, with all the endowment of research against cancer is no study made of those who are free from cancer? Why not inquire what foods they eat, what habits of body and mind they cultivate? And why never study animals in health and natural surroundings? why always sickened and in an environment of strangeness and artificiality?”
—Sarah N. Cleghorn (1976–1959)