There is yet another way to see logic monoid => monad. Definition. Let N be a full subcategory of a category G. A monad (or clone) over N is a pair (K, T) where K is a category with Ob K = Ob N and T is a functor T: K -> G such that for any A, B, C in N (i) K(A, B) = G(A, TB). (ii) f(Tg) = fg for any f in K(A, B) and g in K(B, C) (the order of composition is from left to right). A monad over a category G (in the usual sense) is a monad over the subcategory N = G of G, with K as the Kleisli category and T the right adjoint of the adjunction. A monoid is simply a monad over a singleton (as a subcategory of the category of sets). Examples: Let G = Set be the category of sets. 1. A clone over a singleton is (equivalent to) a monoid. 2. A clone over a finite set is a unitary Menger algebra. 3. A clone over a countably infinite set is simply called a clone. 4. A clone over the subcategory of finite sets is a clone in the classical sense (or a Lawvere theory), which corresponds to a locally finitary clone in the sense of 3 above. 5. A clone over a one-object category is a Kleisli algebra in the sense of E. Manes. For a monad the left algebras (Eilenberg-Moore algebras) represent the smantics (model) and right algebras represent the syntax (logic) of the monad. The theory of right algebras, which is missing from the classical approach to monads, may be applied to study mathematical logic, lambda calculus and recursion theory effectively. From: Clones and Genoids (http://www.algebraic.net/cag/) Zhaohua Luo