The following pages link to Comonadic notions of computation (Q2873672):
Displaying 19 items.
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Complexity bounds for container functors and comonads (Q1640987) (← links)
- Matching logic explained (Q2035650) (← links)
- Whither semantics? (Q2286732) (← links)
- Coalgebraic Components in a Many-Sorted Microcosm (Q2888477) (← links)
- Categorifying computations into components via arrows as profunctors (Q2919448) (← links)
- Higher-order algebras and coalgebras from parameterized endofunctors (Q2919455) (← links)
- Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger . (Q2933114) (← links)
- No-iteration mixed distributive laws (Q2973244) (← links)
- (Q4520815) (← links)
- Codensity Lifting of Monads and its Dual (Q4553284) (← links)
- Universal Constructions for (Co)Relations: categories, monoidal categories, and props (Q4585067) (← links)
- Relating Structure and Power: Comonadic Semantics for Computational Resources (Q5079721) (← links)
- Relating structure and power: Comonadic semantics for computational resources (Q5158366) (← links)
- Coeffects: Unified Static Analysis of Context-Dependence (Q5327449) (← links)
- Unifying structured recursion schemes (Q5371980) (← links)
- Promonads and String Diagrams for Effectful Categories (Q6150166) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)
- Monoidal streams for dataflow programming (Q6649486) (← links)