Traces for coalgebraic components
From MaRDI portal
Publication:3005989
DOI10.1017/S0960129510000551zbMath1230.18004MaRDI QIDQ3005989
Publication date: 10 June 2011
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Related Items (4)
The coinductive resumption monad ⋮ Hybrid Automata as Coalgebras ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ Limits in categories of Vietoris coalgebras
Cites Work
- Unnamed Item
- Bicategories of processes
- Notions of computation and monads
- Bialgebraic methods and modal logic in structural operational semantics
- The geometry of tensor calculus. I
- Higher-dimensional algebra. III: \(n\)-categories and the algebra of opetopes
- Categorical logic and type theory
- Generalising monads to arrows
- Universal coalgebra: A theory of systems
- The uniformity principle on traced monoidal categories
- Linearly distributive functors
- Terminal coalgebras in well-founded set theory
- Modeling component connectors in Reo by constraint automata
- Coalgebraic Components in a Many-Sorted Microcosm
- Categorifying Computations into Components via Arrows as Profunctors
- From Coalgebraic to Monoidal Traces
- A Survey of Graphical Languages for Monoidal Categories
- Functorial Boxes in String Diagrams
- Categorical semantics for arrows
- Games and full completeness for multiplicative linear logic
- Geometry of Interaction and linear combinatory algebras
- Reo: a channel-based coordination model for component composition
- Traced monoidal categories
- The Microcosm Principle and Concurrency in Coalgebra
- Coalgebraic modal logic of finite rank
This page was built for publication: Traces for coalgebraic components
