Comonadic Notions of Computation

DOI10.1016/j.entcs.2008.05.029zbMath1279.68088OpenAlexW2114991657WikidataQ59447211 ScholiaQ59447211MaRDI QIDQ2873672

Varmo Vene, Tarmo Uustalu

Publication date: 24 January 2014

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.2008.05.029

zbMATH Keywords

tree transformationsdataflow computationco-Kleisli semanticscontext-dependent computationsymmetric monoidal comonads

Mathematics Subject Classification ID

Related Items (16)

Coalgebraic Components in a Many-Sorted Microcosm ⋮ Complexity bounds for container functors and comonads ⋮ Categorifying Computations into Components via Arrows as Profunctors ⋮ Higher-order Algebras and Coalgebras from Parameterized Endofunctors ⋮ Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger . ⋮ Promonads and String Diagrams for Effectful Categories ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Runners for interleaving algebraic effects ⋮ Unifying structured recursion schemes ⋮ Coalgebras in functional programming and type theory ⋮ No-iteration mixed distributive laws ⋮ Codensity Lifting of Monads and its Dual ⋮ Universal Constructions for (Co)Relations: categories, monoidal categories, and props ⋮ Matching logic explained ⋮ Whither semantics? ⋮ Relating Structure and Power: Comonadic Semantics for Computational Resources

Uses Software

• LUSTRE
• Lucid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Infinite trees and completely iterative theories: A coalgebraic view
• Generalising monads to arrows
• On an intuitionistic modal logic
• Combining a monad and a comonad
• Completely iterative algebras and completely iterative monads
• Combining effects: sum and tensor
• Containers: Constructing strictly positive types
• The Uniformity Principle on Traced Monoidal Categories
• Recursive monadic bindings
• Premonoidal categories and notions of computation
• The Zipper
• Traced Premonoidal Categories
• An abstract monadic semantics for value recursion
• Semantics for Algebraic Operations
• Implicit parameters
• The Essence of Dataflow Programming
• Semantics of context-free languages: Correction

This page was built for publication: Comonadic Notions of Computation