Monoid - Monoids in Computer Science

Monoids in Computer Science

In computer science, many abstract data types can be endowed with a monoid structure. In a common pattern, a sequence of elements of a monoid is "folded" or "accumulated" to produce a final value. For instance, many iterative algorithms need to update some kind of "running total" at each iteration; this pattern may be elegantly expressed by a monoid operation. Alternatively, the associativity of monoid operations ensures that the operation can be parallelized by employing a prefix sum or similar algorithm, in order to utilize multiple cores or processors efficiently.

Given a sequence of values of type M with identity element and associative operation, the fold operation is defined as follows:

In addition, any data structure can be 'folded' in a similar way, given a serialization of its elements. For instance, the result of "folding" a binary tree might differ depending on pre-order vs. post-order tree traversal.

Read more about this topic:  Monoid

Famous quotes containing the words computer and/or science:

    “Family life is not a computer program that runs on its own; it needs continual input from everyone.”
    —Neil Kurshan (20th century)

    “The natural historian is not a fisherman who prays for cloudy days and good luck merely; but as fishing has been styled “a contemplative man’s recreation,” introducing him profitably to woods and water, so the fruit of the naturalist’s observations is not in new genera or species, but in new contemplations still, and science is only a more contemplative man’s recreation.”
    —Henry David Thoreau (1817–1862)