Algebraic structures which are generated by a collection of constructors| like natural
numbers (generated by a zero and a successor) or nite lists and trees| are of well …

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 …

Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and
software design and verification, unexpected mathematical beauty. The lambda calculus …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

We present a generalization of modal logic to logics which are interpreted on coalgebras of
functors on sets. The leading idea is that infinitary modal logic contains characterizing …

In this paper we introduce a new class of labelled transition systems—labelled Markov
processes—and define bisimulation for them. Labelled Markov processes are probabilistic …

As its title promises, this book provides foundations for software specification and formal
software development from the perspective of work on algebraic specification. It …

Collecting results scattered throughout the literature into one source, An Introduction to
Quasigroups and Their Representations shows how representation theories for groups are …

The classical theory of deterministic automata is presented in terms of the notions of
homomorphism and bisimulation, which are the cornerstones of the theory of (universal) …