Comonadic notions of computation
From MaRDI portal
Recommendations
Cites work
- An abstract monadic semantics for value recursion
- Arrows, like monads, are monoids
- Combining a monad and a comonad
- Combining effects: sum and tensor
- Completely iterative algebras and completely iterative monads
- Computational effects and operations: an overview
- Containers: Constructing strictly positive types
- From comodels to coalgebras: state and arrays
- Generalising monads to arrows
- scientific article; zbMATH DE number 431759 (Why is no real title available?)
- scientific article; zbMATH DE number 3900125 (Why is no real title available?)
- scientific article; zbMATH DE number 515728 (Why is no real title available?)
- scientific article; zbMATH DE number 2090722 (Why is no real title available?)
- scientific article; zbMATH DE number 3305156 (Why is no real title available?)
- Implicit parameters: dynamic scoping with static types
- Infinite trees and completely iterative theories: A coalgebraic view
- Notions of computation and monads
- On an intuitionistic modal logic
- Premonoidal categories and notions of computation
- Recursive monadic bindings
- Semantics for algebraic operations
- Semantics of context-free languages: Correction
- The Essence of Dataflow Programming
- The uniformity principle on traced monoidal categories
- The Zipper
- Traced Premonoidal Categories
Cited in
(30)- Complexity bounds for container functors and comonads
- Matching logic explained
- Whither semantics?
- Coalgebraic components in a many-sorted microcosm
- 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 .
- No-iteration mixed distributive laws
- scientific article; zbMATH DE number 1543339 (Why is no real title available?)
- Codensity lifting of monads and its dual
- Universal constructions for (co)relations: categories, monoidal categories, and props
- Relating structure and power: comonadic semantics for computational resources
- Relating structure and power: Comonadic semantics for computational resources
- The Essence of Dataflow Programming
- Coeffects: unified static analysis of context-dependence
- Unifying structured recursion schemes. An extended study
- Programming Languages and Systems
- Promonads and String Diagrams for Effectful Categories
- Fantastic morphisms and where to find them. A guide to recursion schemes
- Runners for interleaving algebraic effects
- Coalgebras in functional programming and type theory
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Monoidal streams for dataflow programming
- Representing guardedness in call-by-value and guarded parametrized monads
- Coinductive streams in monoidal categories
- The quantum monadology
- Syntax monads for the working formal metatheorist
- No go theorems: directed containers that do not distribute over distribution monads
- String diagrams for premonoidal categories
- Premonoidal and Kleisli double categories
This page was built for publication: Comonadic notions of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873672)
