| | |
Summary: Specifying Interaction Categories
D. Pavlovi'c \Lambda and S. Abramsky y
Abstract
We analyse two complementary methods for obtaining models of typed
process calculi, in the form of interaction categories. These methods allow
adding new features to previously captured notions of process and of type,
respectively. By combining them, all familiar examples of interaction
categories, as well as some new ones, can be built starting from some
simple familiar categories.
Using the presented constructions, interaction categories can be anal
ysed without fixing a set of axioms, merely in terms of the way in which
they are specified --- just like algebras are analysed in terms of equa
tions and relations, independently on abstract characterisations of their
varieties.
1 Introduction
Interaction categories [1] are proposed as a general, yet practical tool for rea
soning about functional and concurrent computation. They are not meant to
be a definitive formal system, but an open list of features that should be con
sidered and corelated. The paradigm of processes as relations extended in time
is proposed as a conceptual basis for integrating type theory and process calcu
|
