Arrow Research search
Back to CSL

CSL 1994

Process Algebra with Combinators

Conference Paper Accepted Paper Logic in Computer Science ยท Theoretical Computer Science

Abstract

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

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
132919954857056054
v2026.09.13