Abstract
We introduce typed combinatory process algebra, a system
combining process Mgebra with types and combinators. We describe its
syntax and semantics, and by way of example, verify within this framework
the Simple Alternating Bit Protocol.
