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 …

Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a
general framework for unifying a wide variety of models of concurrency. Concurrent rewriting …

A model theory that is independent of any concrete logical system allows a general handling
of a large variety of logics. This generality can be achieved by applying the theory of …

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 …

Rewriting as a unified model of concurrency Page 1 Rewriting as a Unified Model of
Concurrency* Jos~ Meseguer SRI International, Menlo Park, CA 94025, and Center for the Study …

It is not an overstatement to say that, in the latest years, there has been an unprecedented
flow of proposals, aiming at methodologies that could offer a flexible framework (intended as …

Within the framework of categorical logic or categorical type theory, predicate logics and
type theories are understood as fibrations with structure. Fibrations, or fibred categories …

Interpreting η-conversion as an expansion rule in the simply-typed λ-calculus maintains the
confluence of reduction in a richer type structure. This use of expansions is supported by …

We present a categorical characterization of term graphs (ie, finite, directed acyclic graphs
labeled over a signature) that parallels the well-known characterization of terms as arrows of …

The dynamic behavior of rule-based systems (like term rewriting systems [24], process
algebras [27], and so on) can be traditionally determined in two orthogonal ways. Either …