Traces for coalgebraic components
From MaRDI portal
Recommendations
Cites work
- A survey of graphical languages for monoidal categories
- Bialgebraic methods and modal logic in structural operational semantics
- Bicategories of processes
- Categorical logic and type theory
- Categorical semantics for arrows
- Categorifying computations into components via arrows as profunctors
- Coalgebraic components in a many-sorted microcosm
- Coalgebraic modal logic of finite rank
- From coalgebraic to monoidal traces
- Functorial Boxes in String Diagrams
- Games and full completeness for multiplicative linear logic
- Generalising monads to arrows
- Geometry of Interaction and linear combinatory algebras
- Higher-dimensional algebra. III: \(n\)-categories and the algebra of opetopes
- scientific article; zbMATH DE number 1393359 (Why is no real title available?)
- Linearly distributive functors
- Modeling component connectors in Reo by constraint automata
- Notions of computation and monads
- Reo: a channel-based coordination model for component composition
- Terminal coalgebras in well-founded set theory
- The geometry of tensor calculus. I
- The Microcosm Principle and Concurrency in Coalgebra
- The uniformity principle on traced monoidal categories
- Traced monoidal categories
- Universal coalgebra: A theory of systems
Cited in
(10)- The coinductive resumption monad
- Coalgebraic components in a many-sorted microcosm
- Traces, Executions and Schedulers, Coalgebraically
- From coalgebraic to monoidal traces
- Coalgebraic Trace Semantics via Forgetful Logics
- Coalgebraic trace semantics via forgetful logics
- Limits in categories of Vietoris coalgebras
- Hybrid automata as coalgebras
- Semantics of higher-order quantum computation via geometry of interaction
- Coalgebraic Infinite Traces and Kleisli Simulations
This page was built for publication: Traces for coalgebraic components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005989)
