Dynamic connectors for concurrency
Theoretical Computer Science
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Tile Transition Systems as Structured Coalgebras
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.00 |
We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the other to compose their computations and their observations. Also, inspired by the connection between simply typed lambda-calculus and cartesian closed categories, we define a new typed framework, called double lambda-notation, which is able to express the abstraction/application and pairing/projection operations in all dimensions. In this development, we take the categorical presentation as a guidance in the interpretation of the formalism. A case study of the pi-calculus, where the double lambda-notation straightforwardly handles name passing and creation, concludes the presentation.