Retracing some paths in process algebra
From MaRDI portal
Abstract: We use traced monoidal categories to give a precise general version of "geometry of interaction". We give a number of examples of both "particle-style" and "wave-style" instances of this construction. We relate these ideas to semantics of computation.
Cites work
- A calculus of communicating systems
- A calculus of mobile processes. II
- A logical view of composition
- A Powerdomain Construction
- Coherence for compact closed categories
- Functions as processes
- Games and full completeness for multiplicative linear logic
- scientific article; zbMATH DE number 3936542 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3495581 (Why is no real title available?)
- scientific article; zbMATH DE number 4123722 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- scientific article; zbMATH DE number 910713 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- New foundations for the geometry of interaction
- Proofs as processes
- Special issue on Hybrid systems
- The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
Cited in
(37)- Feedback for linearly distributive categories: Traces and fixpoints
- String diagrams for traced and compact categories are oriented 1-cobordisms
- Simple free star-autonomous categories and full coherence
- A specification structure for deadlock-freedom of synchronous processes
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- A structural approach to reversible computation
- Categories of timed stochastic relations
- Information processing in convex operational theories
- The coinductive resumption monad
- A categorical framework for typing CCS-style process communication
- Physical traces: quantum vs. classical information processing
- The uniformity principle on traced monoidal categories
- Event domains, stable functions and proof-nets
- Conformal field theory as a nuclear functor
- Labelled Markov processes as generalised stochastic relations
- Geometry of synthesis. II: From games to delay-insensitive circuits
- Attribute Grammars and Categorical Semantics
- Pseudo-commutative monads
- DisCoPy: monoidal categories in Python
- Join inverse categories and reversible recursion
- Logic and geometry of agents in agent-based modeling
- Inversion, iteration, and the art of dual wielding
- What are the fundamental structures of concurrency? We still don't know!
- Musings around the geometry of interaction, and coherence
- Towards a geometry of recursion
- Proofs as Polynomials
- Linear realizability and full completeness for typed lambda-calculi
- A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations
- The game semantics of game theory
- On strictifying extensional reflexivity in compact closed categories
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Principal types as partial involutions
- -symsym: an interactive tool for playing with involutions and types
- A categorical model for the geometry of interaction
- A type assignment system for game semantics
- Machine semantics
- Quantum circuit oracles for abstract machine computations
This page was built for publication: Retracing some paths in process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104362)
