Producing actions from binary functions.

Abstract functions for calculating conjugate elements, conjugacy classes,
and representatives.

Constructing isomorphisms/embeddings between semigroups given  by generators.
In other words, searching for an isomorphisms of Cayley-graphs.
The elements of both semigroups are fully enumerated.
The source semigroup is converted to generator table (partial multiplication
table containing all the images of right multiplication by generators).
The elements of target semigroups are classified by their index-periods in
order to find possible targets for generators.
Canonical notation for the data structure for Cayley-graph matching is M.
 It's a hasmap with keys :phi :Sgens :Smul :Tmul. Phi is the morphism
 (hash-map) that is induced by matching the (sub)semigroup generated by
 :Sgens.

Black box algorithms to compute Green's relations. Basic implementations,
not efficient ones. Suitable for small semigroups, written for processing
the enumerated transformation semigroups.

General functions for semigroups. Black box style, the element(s)
and the operation need to be supplied.

General functions for computing subsemigroups.
Black box style, the element(s) and the operation need to be supplied.

Enumerating all semigroup(oid)s using relational programming.
Semigroupoids are represented as composition tables, a vector of vectors.

Finding all homomorphisms of a semigroupoid into another one by using
relational programming.
Semigroupoids are represented abstractly, as composition tables, a vector of
vectors. For non-composable arrow pairs the corresponding entry is :n.

Transformation semigroupoids.
:s - source, domain, integer 0..n-1
:t - target, codomain, integer 0..n-1
:m - morphism, map

Functions for the type structure of a semigroupoid.