The following pages link to Generalising monads to arrows (Q1566910):
Displaying 45 items.
- ``Keep definition, change category'' -- a practical approach to state-based system calculi (Q299180) (← links)
- Monad transformers as monoid transformers (Q615955) (← links)
- Cartesian effect categories are Freyd-categories (Q631572) (← links)
- Commutativity (Q899553) (← links)
- Arrows for secure information flow (Q964489) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- Reversible effects as inverse arrows (Q2134817) (← links)
- On the semantics of parsing actions (Q2441511) (← links)
- Implementation and use of the PLT scheme web server (Q2464729) (← links)
- Implication via spacetime (Q2658280) (← links)
- Modelling parallel quantum computing using transactional memory (Q2825358) (← links)
- Quantum circuits: from a network to a one-way model (Q2825360) (← links)
- Arrows, like monads, are monoids (Q2851324) (← links)
- Quantum arrows in Haskell (Q2870213) (← links)
- Comonadic notions of computation (Q2873672) (← links)
- Coalgebraic Components in a Many-Sorted Microcosm (Q2888477) (← links)
- Categorifying computations into components via arrows as profunctors (Q2919448) (← links)
- Commutative Semantics for Probabilistic Programming (Q2988671) (← links)
- Traces for coalgebraic components (Q3005989) (← links)
- (Q3384908) (← links)
- An Introduction to iTasks: Defining Interactive Work Flows for the Web (Q3599175) (← links)
- A Groupoid of Isomorphic Data Transformations (Q3637276) (← links)
- The Arrow Calculus as a Quantum Programming Language (Q3638297) (← links)
- Categorical semantics for arrows (Q3638922) (← links)
- Traced Premonoidal Categories (Q4460686) (← links)
- Quotienting the delay monad by weak bisimilarity (Q4559601) (← links)
- Notions of computation as monoids (Q4625158) (← links)
- An abstract monadic semantics for value recursion (Q4659889) (← links)
- Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
- Causal commutative arrows (Q4918242) (← links)
- Compositional Game Theory, Compositionally (Q5019677) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Build systems à la carte: Theory and practice (Q5110937) (← links)
- Fault-tolerant functional reactive programming (extended version) (Q5120226) (← links)
- What is a Categorical Model of Arrows? (Q5166619) (← links)
- Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous (Q5166623) (← links)
- The arrow calculus (Q5189645) (← links)
- Combinator Parsing: A Short Tutorial (Q5191092) (← links)
- EditorArrow: An arrow-based model for editor-based programming (Q5298793) (← links)
- Finally tagless observable recursion for an abstract grammar model (Q5300699) (← links)
- Flexible dynamic information flow control in the presence of exceptions (Q5371997) (← links)
- Applicative programming with effects (Q5437031) (← links)
- Promonads and String Diagrams for Effectful Categories (Q6150166) (← links)
- Type-safe quantum programming in Idris (Q6535254) (← links)
- Lewisian fixed points. I: Two incomparable constructions (Q6612808) (← links)
