An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories

We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concrete syntax for strong monads on functor categories, and are a convenient framework for names and binding. Our programs are built from the key primitives fork' and wait’. Fork' creates a child thread and passes its name (thread ID) to the parent thread. Wait’ allows us to wait for given child threads to finish. We provide a parameterized algebraic theory built from fork and wait, together with basic atomic actions and laws such as associativity of `fork’. Our equational axiomatization is complete in two senses. First, for closed expressions, it completely captures equality of labelled posets (pomsets), an established model of concurrency: model complete. Second, any two open expressions are provably equal if they are equal under all closing substitutions: syntactically complete. The benefit of algebraic effects is that the semantic analysis can focus on the algebraic operations of fork and wait. We then extend the analysis to a simple concurrent programming language by giving operational and denotational semantics. The denotational semantics is built using the methods of parameterized algebraic theories and we show that it is sound, adequate, and fully abstract at first order for labelled-poset observations.

💡 Research Summary

The paper presents a fully equational axiomatization of dynamic thread creation and synchronization using the theory of algebraic effects, specifically through parameterized algebraic theories. The authors focus on two primitive operations—fork and wait—together with stop and atomic actions (act σ). Fork spawns a child thread, returns its identifier (tid) to the parent, and runs both parent and child continuations concurrently; wait blocks the current thread until a specified set of thread IDs have terminated; stop terminates the current thread and unblocks any waiting threads; act σ records an observable atomic action.

A set of eight equations governing these operations is introduced. The equations capture associativity of fork, unit laws for wait‑stop, commutation of independent forks, and the proper handling of thread identifiers. These axioms are shown to be model complete for closed terms: every closed term denotes a unique labelled poset (pomset), and the equational theory exactly characterizes pomset equality. The authors prove a representation theorem (Theorem 5.4) that any term modulo the equations can be represented as a labelled poset possibly containing “holes” for the continuations of forked threads. This representation bridges the syntax of the algebraic theory with the established true‑concurrency model of pomsets.

For open terms, a syntactic completeness result (Theorem 6.1) is established: if two open terms become equal under every closing substitution (i.e., after plugging in closed terms for all free variables), then the two terms are provably equal using the axioms. The proof constructs special substitution gadgets that expose the underlying pomset structure, effectively yielding a full‑abstraction property for the equational theory.

The paper then embeds these ideas into a small functional concurrent language. Types include thread identifiers (tid), products, sums, and functions; values are pure, while computations may invoke the four primitives. An operational semantics is given via a labelled transition system that records both the performed atomic action and the thread ID that performed it. This system yields a unique labelled poset for each closed program, guarantees termination, and prevents deadlock (a child can never wait for its parent). The operational model thus satisfies the same pomset equivalence captured by the algebraic axioms.

Using the parameterized algebraic theory, the authors construct a strong monad on the functor category (