Results 1 
3 of
3
Interaction Categories and the Foundations of Typed Concurrent Programming
 In Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School, NATO ASI Series F
, 1995
"... We propose Interaction Categories as a new paradigm for the semantics of functional and concurrent computation. Interaction categories have specifications as objects, processes as morphisms, and interaction as composition. We introduce two key examples of interaction categories for concurrent compu ..."
Abstract

Cited by 122 (18 self)
 Add to MetaCart
We propose Interaction Categories as a new paradigm for the semantics of functional and concurrent computation. Interaction categories have specifications as objects, processes as morphisms, and interaction as composition. We introduce two key examples of interaction categories for concurrent computation and indicate how a general axiomatisation can be developed. The upshot of our approach is that traditional process calculus is reconstituted in functorial form, and integrated with type theory and functional programming.
A Typed Calculus of Synchronous Processes
 In Proceedings of IEEE Symposium on Logic in Computer Science
, 1995
"... We propose a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed calculus is canonical for functional computation. We show strong connections between syntax, lo ..."
Abstract

Cited by 56 (4 self)
 Add to MetaCart
We propose a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed calculus, intuitionistic logic and cartesian closed categories. 1 Introduction T ypes are fundamental to the study of functional computation, for both theoretical and practical reasons. On the foundational side there are elegant connections between the typed calculus, intuitionistic logic and cartesian closed categories, leading to the Propositions as Types paradigm [14] and the development of categorical logic [9,17]. From a practical point of view, compiletime type reconstruction is a boon to the programmer in languages such as Standard ML and Haskell. Turning to concurrency, the situation is much less sati...
Specification Structures and PropositionsasTypes for Concurrency
 Logics for Concurrency: Structure vs. AutomataProceedings of the VIIIth Banff Higher Order Workshop, volume 1043 of Lecture Notes in Computer Science
, 1995
"... Many different notions of "property of interest" and methods of verifying such properties arise naturally in programming. A general framework of "Specification Structures" is presented for combining different notions and methods in a coherent fashion. This is then applied to concurrency in the se ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Many different notions of "property of interest" and methods of verifying such properties arise naturally in programming. A general framework of "Specification Structures" is presented for combining different notions and methods in a coherent fashion. This is then applied to concurrency in the setting of Interaction Categories.