This book is a textbook in basic category theory, written specifically to be read by
researchers and students in computing science. We expound the constructions we feel are …

Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

Basic Category Theory for Computer Scientists provides a straightforward presentation of
the basic constructions and terminology of category theory, including limits, functors, natural …

This is an account of a project we have undertaken in which basic constructions of category
theory are expressed as computer programs. The programs are written in a functional …

We introduce an algebraic approach to E-unification, through the notions of finitely
presented and projective object. As applications and examples, we determine the unification …

We present a general methodology aimed at providing an algebraic semantics for a large
class of formalisms. The methodology, which generalizes the algebraic treatment of Petri …

We provide a framework for equational deduction based on category theory. Firstly, drawing
upon categorical logic, we show how the compositional structure of equational deduction is …

We study the unification problem for a class of equational theories that comprises important
examples like abelian monoids (AC), idempotent abelian monoids (ACI), and abelian …

Multisets are widely used in membrane computing models such as cP systems. In this paper,
we formally define the first-order one-way unification problem for labelled nested multisets …

Domain and Antidomain Semigroups Page 1 Domain and Antidomain Semigroups Jules
Desharnais1, Peter Jipsen2, and Georg Struth3 1 Département d’informatique et de génie …