Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Theoretical Computer Science
Communication and concurrency
A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Research topics in functional programming
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
A calculus of mobile processes, I
Information and Computation
A fully abstract denotational model for higher-order processes
Information and Computation
Handbook of logic in computer science (vol. 4)
Some Properties of Predicate Transformers
Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A Calculus of Communicating Systems
A Calculus of Communicating Systems
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Linearity in Process Languages
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Game Semantics for Programming Languages (Abstract)
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
A Relational Model of Non-deterministic Dataflow
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
A Fully Abstract Relational Model of Syntactic Control of Interference
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
CONCUR 2005 - Concurrency Theory
Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic domains of timed event structures
Programming and Computing Software
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Real-time stable event structures and marked scott domains: an adjunction
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Nominal domain theory for concurrency
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices of comonad yield two expressive metalanguages for higher-order processes, both arising from canonical constructions in the model. Their denotational semantics are fully abstract with respect to contextual equivalence. One language derives from an exponential of linear logic; it supports a straightforward operational semantics with simple proofs of soundness and adequacy. The other choice of comonad yields a model of affine-linear logic, and a process language with a tensor operation to be understood as a parallel composition of independent processes. The domain theory can be generalised to presheaf models, providing a more refined treatment of nondeterministic branching. The article concludes with a discussion of a broader programme of research, towards a fully fledged domain theory for concurrency.