Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Event Structure Spans for Nondeterministic Dataflow
Electronic Notes in Theoretical Computer Science (ENTCS)
A general framework for sound and complete Floyd-Hoare logics
ACM Transactions on Computational Logic (TOCL)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus
Theoretical Computer Science
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the semantics of nondeterministic dataflow. Profunctors are shown to play a key role in relating models for concurrency and to support an interpretation as higher-order processes (where input and output may be processes). Two recent directions of research are described. One is concerned with a language and computational interpretation for profunctors. This addresses the duality between input and output in profunctors. The other is to investigate general spans of event structures(the spans can be viewed as special profunctors) to give causalsemantics to higher-order processes. For this it is useful to generalise event structures to allow events which "persist."