Notions of computation and monads
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Science of Computer Programming - Special issue on mathematics of program construction
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Categories of Processes Enriched in Final Coalgebras
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Coalgebraic modal logic of finite rank
Mathematical Structures in Computer Science
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Categorical semantics for arrows
Journal of Functional Programming
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Categorifying Computations into Components via Arrows as Profunctors
Electronic Notes in Theoretical Computer Science (ENTCS)
From Coalgebraic to Monoidal Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
This paper contributes a feedback operator, in the form of a monoidal trace, to the theory of coalgebraic, state-based modelling of components. The feedback operator on components is shown to satisfy the trace axioms of Joyal, Street and Verity. We employ McCurdy's tube diagrams, which are an extension of standard string diagrams for monoidal categories, to represent and manipulate component diagrams. The microcosm principle then yields a canonical ???inner??? traced monoidal structure on the category of resumptions (elements of final coalgebras/components). This generalises an observation by Abramsky, Haghverdi and Scott.