Typed Monoids: Theory and Practice

• Typed monoids are monoids endowed with extra structure—such as signature, indexing, or effects—that refines how their operations are interpreted.
• They appear in various contexts, from universal algebra (classifying chain varieties) to category theory (as internal monoid objects with many-object structures).
• In automata theory and algorithmic algebra, typed monoids are used to control recognition processes, enforce variable typing, and characterize computational complexity.

“Typed monoids” is not a single standardized notion. In current literature, the phrase is used in several non-equivalent senses. In universal algebra, monoids are typed by their signature, namely algebras of type $(2,0)$ with one binary operation and one nullary operation (Gusev et al., 2017). In category theory, the term often denotes monoid objects whose carrier already carries index, effect, or boundary data, as in indexed containers, Eilenberg–Moore monoids, and monoids in left-skew or bi-skew multicategories (Pascalis et al., 30 Sep 2025, Piróg, 2016, Levy et al., 16 Apr 2025). In algebraic automata theory, a typed monoid is a triple $(M,G,E)$ consisting of a base monoid, a Boolean algebra of admissible subsets, and a finite set of units, used to control recognition by possibly infinite monoids (Dawar et al., 14 Aug 2025). In algorithmic algebra, “typed” may instead refer to constraints on variables in equations over monoids, notably idempotent and reduced variables in free inverse monoids (Diekert et al., 2014).

1. Universal-algebraic typing: monoids as algebras of type $(2,0)$

In universal algebra, a monoid is an algebra

$M=(M,\cdot,1)$

whose signature has one binary operation and one nullary operation, so its type is $(2,0)$. The binary operation is associative and the nullary symbol designates a two-sided identity: $(xy)z=x(yz),\qquad 1x=x1=x.$ This use of “typed” is purely signature-theoretic: monoids are not treated as semigroups with an informally attached identity, but as algebras whose language already contains the constant $1$ (Gusev et al., 2017).

Within that setting, varieties of monoids are equational classes in the language of type $(2,0)$. If $\Sigma$ is a set of identities, $\operatorname{var}\Sigma$ denotes the variety it defines; if $(M,G,E)$0 is a monoid, $(M,G,E)$1 is the generated variety. The subvarieties of a variety $(M,G,E)$2 form a lattice $(M,G,E)$3, and a chain variety is one for which $(M,G,E)$4 is a chain. The paper “Chain varieties of monoids” gives a complete classification of non-group chain varieties of monoids in this typed sense. Its Theorem 1.1 states that a non-group monoid variety is a chain variety iff it is contained in one of

$(M,G,E)$5

and Corollary 7.1 gives the full list of all non-group chain varieties, including $(M,G,E)$6, and their duals (Gusev et al., 2017).

This universal-algebraic sense of typed monoid is narrow but foundational. It fixes the formal language in which identities are interpreted, and the paper emphasizes that passing from semigroups of type $(M,G,E)$7 to monoids of type $(M,G,E)$8 substantially enlarges and complicates the chain-variety landscape. A notable example is the variety

$(M,G,E)$9

which the paper identifies as the unique non-finitely based non-group chain variety of monoids, and moreover a limit variety. The same work also proves that all non-group chain monoid varieties are locally finite (Gusev et al., 2017).

2. Internal, many-object, and skew-categorical typed monoids

A second major usage treats typed monoids as internal algebraic objects in categories where typing is carried by the ambient structure rather than by a bare carrier set. One important case is the category $(2,0)$0 of sets and relations, monoidal under cartesian product. A monoid object in $(2,0)$1 consists of a set $(2,0)$2, a relational multiplication $(2,0)$3, and a unit relation $(2,0)$4. Because the unit relation selects a subset $(2,0)$5, such a relational monoid may have many units globally, and Proposition 1 shows that every element has a unique left unit and a unique right unit. In that framework, every small category is a relational monoid: the underlying set is the set of arrows, multiplication is composition, and the set of units is the set of identity arrows. The source and target of an arrow are thereby encoded as its left and right units, so categories become many-object, hence typed, monoids in a precise categorical sense (Jenčová et al., 2017).

A different internal notion is the Eilenberg–Moore monoid. For a strong monad $(2,0)$6 on a monoidal category $(2,0)$7, an Eilenberg–Moore $(2,0)$8-monoid is a tuple

$(2,0)$9

such that $M=(M,\cdot,1)$0 is an Eilenberg–Moore algebra, $M=(M,\cdot,1)$1 is a monoid, and the coherence law

$M=(M,\cdot,1)$2

holds. Here the typing comes from the ambient object $M=(M,\cdot,1)$3, while the extra algebra structure $M=(M,\cdot,1)$4 makes the monoid effect-aware. The paper shows that the forgetful functor from $M=(M,\cdot,1)$5 has a left adjoint and that the induced monad is the list monad transformer

$M=(M,\cdot,1)$6

It also proves that $M=(M,\cdot,1)$7 is isomorphic to the Eilenberg–Moore category of $M=(M,\cdot,1)$8, so Eilenberg–Moore monoids are exactly the algebras for the “ListT done right” construction (Piróg, 2016).

A further generalization appears in the theory of left-skew and bi-skew multicategories. Ordinary multicategories treat all input positions uniformly, but relative monads and call-by-push-value sequencing distinguish the leftmost and sometimes also the rightmost input. Levy and Rogers therefore define monoids in left-skew multicategories, where the leftmost factor is distinguished, and in bi-skew multicategories, where both the leftmost and rightmost factors may be distinguished. In this framework, an $M=(M,\cdot,1)$9-relative monad is precisely a monoid in a certain left-skew multicategory, while a category on a span and a CBPV sequencing model are monoids in certain bi-skew multicategories (Levy et al., 16 Apr 2025). This shifts the meaning of typing from many-sorted carriers to position-sensitive composition laws.

3. Indexed and dependently typed monoids

In dependently typed and indexed settings, monoid structure is often carried by families rather than by a single set. The paper “Monoid Structures on Indexed Containers” fixes an indexing set $(2,0)$0 and studies the monoidal category $(2,0)$1 of $(2,0)$2-indexed containers, where an indexed container consists of

$(2,0)$3

Its extension is an endofunctor on $(2,0)$4, and the monoidal product is container composition. The monoidal unit is the identity container $(2,0)$5, with

$(2,0)$6

A monoid in this monoidal category is an indexed container $(2,0)$7 equipped with

$(2,0)$8

satisfying the usual monoid diagrams, but now with explicit index coherence (Pascalis et al., 30 Sep 2025).

The paper unpacks this abstract structure into an indexed container monoid structure $(2,0)$9. Its shape-level data are a unit

$(xy)z=x(yz),\qquad 1x=x1=x.$0

and a multiplication

$(xy)z=x(yz),\qquad 1x=x1=x.$1

together with position-level coherence maps describing how every position in a composite shape decomposes into an outer position, an inner position, and an intermediate index. Lemma 3.6 proves that monoid structures in $(xy)z=x(yz),\qquad 1x=x1=x.$2 are equivalent to $(xy)z=x(yz),\qquad 1x=x1=x.$3, and Theorem 3.11 shows that the full subcategory of $(xy)z=x(yz),\qquad 1x=x1=x.$4-monads whose endofunctors are extents of indexed containers is equivalent to $(xy)z=x(yz),\qquad 1x=x1=x.$5. In this sense, these typed monoids are exactly monads on indexed-container endofunctors, presented combinatorially at the level of shapes and positions. The examples include the product of two monads, indexed state, indexed writer, and a free monad for well-scoped $(xy)z=x(yz),\qquad 1x=x1=x.$6-terms (Pascalis et al., 30 Sep 2025).

Homotopy type theory gives another parameterized notion. The paper “Free Commutative Monoids in Homotopy Type Theory” studies the construction

$(xy)z=x(yz),\qquad 1x=x1=x.$7

of the free commutative monoid on a set $(xy)z=x(yz),\qquad 1x=x1=x.$8, interpreted as the type of finite multisets over $(xy)z=x(yz),\qquad 1x=x1=x.$9. The universal property is internalized as an equivalence

$1$0

and the paper formalizes two equivalent 1-HIT presentations, $1$1 and $1$2, together with a quotient-of-lists presentation. It proves structural results such as conicality, the refinement property, and a characterization of the equality type of finite multisets, all without assuming decidable equality on $1$3 (Choudhury et al., 2021). Here the monoid is typed in the sense that it is indexed by a carrier type and internalized inside HoTT.

4. Typed equations and presentation-defined structured monoids

A more algorithmic meaning of typed monoid arises in the study of equations over free inverse monoids. In that setting, the ambient algebra is the free inverse monoid $1$4, and a typed equation uses three disjoint alphabets:

• $1$5 for constants,
• $1$6 for idempotent variables,
• $1$7 for reduced variables.

The typing discipline requires that every $1$8 satisfy $1$9 and be mapped to an idempotent of $(2,0)$0, while every $(2,0)$1 is mapped to a reduced word. Thus “typed” means that variables are assigned to distinguished semantic classes rather than that the monoid operation itself is many-sorted. The paper proves that solvability of systems of equations in idempotent variables over $(2,0)$2 is decidable in DEXPTIME, and DEXPTIME-hard for systems with two equations as soon as the quotient group has rank at least two. It also proves DEXPTIME decidability for typed systems with one reduced variable and at least one strongly unbalanced equation (Diekert et al., 2014).

A related but distinct presentation-sensitive line is the study of prefix monoids and monoids of right units. A prefix monoid of a finitely presented group is the submonoid generated by the prefixes of its defining relators. The paper “Prefix monoids of groups and right units of special inverse monoids” proves that not every finitely generated recursively presented group-embeddable monoid is a prefix monoid, but that every such monoid becomes one after free product with a free monoid of sufficiently large finite rank. More precisely, for every group-embeddable recursively presented monoid $(2,0)$3, there exists $(2,0)$4 such that

$(2,0)$5

is a prefix monoid iff $(2,0)$6, and every prefix monoid arises in this way. The same paper shows that the groups of units of prefix monoids are exactly the finitely generated recursively presented groups, while the Schützenberger groups of prefix monoids are exactly the recursively enumerable subgroups of finitely presented groups (Dolinka et al., 2023). These objects are not usually called typed monoids outright, but they are presentation-defined structured monoids with tightly controlled internal group data.

5. Typed monoids in algebraic automata theory and circuit complexity

In algebraic complexity theory, a typed monoid is a specific recognition device. The paper “Characterizing $(2,0)$7 with Typed Monoids” defines a typed monoid as a triple

$(2,0)$8

where $(2,0)$9 is a monoid, $\Sigma$0 is a Boolean algebra of subsets of $\Sigma$1 called types, and $\Sigma$2 is a finite set of units. The typing mechanism imposes two restrictions absent from ordinary recognition by infinite monoids: the accepting set must belong to $\Sigma$3, and letters of the input alphabet must map into the finite set $\Sigma$4. A language $\Sigma$5 is recognized by $\Sigma$6 if there is a typed monoid homomorphism from

$\Sigma$7

to $\Sigma$8. When the base monoid is finite, this recovers the classical notion of recognition by a finite monoid (Dawar et al., 14 Aug 2025).

This framework supports a typed analogue of syntactic monoids. The syntactic typed monoid of a language $\Sigma$9 is

$\operatorname{var}\Sigma$0

where $\operatorname{var}\Sigma$1 is the ordinary syntactic congruence. Typed congruences are required to respect the Boolean algebra of types, and the paper shows that a typed monoid is the syntactic typed monoid of a language iff it is reduced, generated by its units, and has four or two types (Dawar et al., 14 Aug 2025).

The main result is an algebraic characterization of $\operatorname{var}\Sigma$2: $\operatorname{var}\Sigma$3 Here $\operatorname{var}\Sigma$4 is the typed quantifier monoid for majority, $\operatorname{var}\Sigma$5 is the typed quantifier monoid for the square quantifier, and $\operatorname{var}\Sigma$6 supplies the finite non-solvable group component. The proof proceeds by first collapsing higher-dimensional finite monoid multiplication quantifiers to unary ones and then applying a logic-to-algebra correspondence for unary multiplication quantifiers (Dawar et al., 14 Aug 2025). In this sense, typed monoids extend algebraic automata methods from regular languages to small circuit classes.

6. Scope distinctions and neighboring notions

The breadth of current usage makes scope distinctions essential. Some nearby theories employ monoidal language or structured monoids without using “typed monoid” in any of the senses above. The Agda formalization of typed term graphs, for example, studies typed hypergraph morphisms in a symmetric gs-monoidal category. The paper explicitly states that it is not about a typed monoid in the narrow algebraic sense of one carrier with a typed binary operation; its main structure is a typed monoidal or gs-monoidal category of term graphs (Kahl, 2011).

Other works use monoids as typed design principles rather than as formal objects of a separate theory. “Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms” argues that efficient local aggregation requires choosing the mapper’s intermediate value type so that it forms a monoid. Its central examples replace raw integers by pairs $\operatorname{var}\Sigma$7 with

$\operatorname{var}\Sigma$8

or by associative arrays under pointwise addition. This is a typed use of monoids at the level of data representation, but not a stand-alone formal theory of typed monoids (Lin, 2013).

Conversely, some papers emphasize that a given monoid family is not typed in the relevant categorical sense. “Forward operator monoids” studies commutative endomorphism monoids

$\operatorname{var}\Sigma$9

indexed by a discrete commutative monoid $(M,G,E)$00, with $(M,G,E)$01, but it explicitly notes that these are untyped endomorphism monoids rather than typed systems with varying domains or codomains (Felder, 2024). Likewise, the universal-algebraic treatment of monoids as algebras of type $(M,G,E)$02 is “typed” at the level of operation arities, not at the level of many-object composition or indexed substitution (Gusev et al., 2017).

Taken together, these contrasts show that “typed monoids” is best treated as an umbrella term for several research programs. Its most stable core is the passage from a bare monoid law to a monoid law constrained by explicit structure: a formal signature, a family of indices, an ambient effect or boundary discipline, a distinguished Boolean algebra of admissible subsets, or a semantic sorting of variables.