Categorifying Computations into Components via Arrows as Profunctors

DOI10.1016/j.entcs.2010.07.012zbMath1247.68084OpenAlexW1964430373MaRDI QIDQ2919448

Kazuyuki Asada, Ichiro Hasuo

Publication date: 2 October 2012

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.07.012

zbMATH Keywords

arrowcoalgebracomputationcomponentprofunctor

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categories of machines, automata (18B20)

Related Items (2)

Notions of computation as monoids ⋮ Traces for coalgebraic components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• A small complete category
• Higher-dimensional algebra. III: \(n\)-categories and the algebra of opetopes
• Categorical logic and type theory
• Modelling environments in call-by-value programming languages.
• Generalising monads to arrows
• Universal coalgebra: A theory of systems
• Monads on symmetric monoidal closed categories
• The formal theory of monads
• Comonadic Notions of Computation
• Coalgebraic Components in a Many-Sorted Microcosm
• Categorical semantics for arrows
• Premonoidal categories and notions of computation
• Traced Premonoidal Categories
• What is a Categorical Model of Arrows?
• A new notation for arrows
• The Microcosm Principle and Concurrency in Coalgebra

This page was built for publication: Categorifying Computations into Components via Arrows as Profunctors