Theoretical Computer Science
A fully abstract denotational model for higher-order processes
Information and Computation
Handbook of logic in computer science (vol. 4)
Presheaves as transition systems
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Communication and Concurrency
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Linearity in Process Languages
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On Semantic Foundations for Applicative Multiprogramming
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Relational Model of Non-deterministic Dataflow
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Presheaf Semantics of Value-Passing Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Theory of Recursive Domains with Applications to Concurrency
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Presheaf models for CCS-like languages
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Categorical semantics for arrows
Journal of Functional Programming
Theoretical Computer Science
A general framework for sound and complete Floyd-Hoare logics
ACM Transactions on Computational Logic (TOCL)
Limit Preservation from Naturality
Electronic Notes in Theoretical Computer Science (ENTCS)
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Modal event-clock specifications for timed component-based design
Science of Computer Programming
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
This paper studies fundamental connections between profunctors (that is, distributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between presheaf categories (corresponding to a profunctor) preserves open maps and open map bisimulation. Consequently, the composition of profunctors preserves open maps as 2-cells. A guiding idea is the view that profunctors, and colimit preserving functors, are linear maps in a model of classical linear logic. But profunctors, and colimit preserving functors, as linear maps, are too restrictive for many applications. This leads to a study of a range of pseudo-comonads and of how non-linear maps in their co-Kleisli bicategories preserve open maps and bisimulation. The pseudo-comonads considered are based on finite colimit completion, ‘lifting’, and indexed families. The paper includes an appendix summarising the key results on coends, left Kan extensions and the preservation of colimits. One motivation for this work is that it provides a mathematical framework for extending domain theory and denotational semantics of programming languages to the more intricate models, languages and equivalences found in concurrent computation, but the results are likely to have more general applicability because of the ubiquitous nature of profunctors.