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:
“Piety practised in solitude, like the flower that blooms in the desert, may give its fragrance to the winds of heaven, and delight those unbodied spirits that survey the works of God and the actions of men; but it bestows no assistance upon earthly beings, and however free from taints of impurity, yet wants the sacred splendour of beneficence.”
—Samuel Johnson (1709–1784)