The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- Strong functors on many-sorted sets (Q5218975) (← links)
- Finitely Presentable Algebras For Finitary Monads (Q5243048) (← links)
- PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION (Q5249252) (← links)
- Amb Breaks Well-Pointedness, Ground Amb Doesn't (Q5262940) (← links)
- Taut Monads, Dynamic Logic and Determinism (Q5262941) (← links)
- Relational Parametricity for Control Considered as a Computational Effect (Q5262944) (← links)
- The parametric continuation monad (Q5269001) (← links)
- Adjoint Logic with a 2-Category of Modes (Q5283430) (← links)
- Constructive forcing, CPS translations and witness extraction in Interactive realizability (Q5360214) (← links)
- Interleaving data and effects (Q5371955) (← links)
- Correctness of compiling polymorphism to dynamic typing (Q5371998) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- (Q5376659) (← links)
- Monadic translation of classical sequent calculus (Q5410235) (← links)
- A Categorical Model of the Fusion Calculus (Q5415643) (← links)
- Tensors of Comodels and Models for Operational Semantics (Q5415644) (← links)
- A monadic framework for delimited continuations (Q5428371) (← links)
- Monadic augment and generalised short cut fusion (Q5428372) (← links)
- On one-pass CPS transformations (Q5428374) (← links)
- On the ubiquity of certain total type structures (Q5430138) (← links)
- Automata, Languages and Programming (Q5466522) (← links)
- Towards Effects in Mathematical Operational Semantics (Q5739352) (← links)
- Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions (Q5739353) (← links)
- Capsules and Closures (Q5739358) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
- Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot (Q5875354) (← links)
- Untyped lambda-calculus with input-output (Q5878918) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Stream processors and comodels (Q5883748) (← links)
- Lifting theorems for Kleisli categories (Q5890054) (← links)
- Probabilistic power domains, information systems, and locales (Q5890059) (← links)
- On the transformation between direct and continuation semantics (Q5890072) (← links)
- Fusion of recursive programs with computational effects (Q5941164) (← links)
- Unguarded recursion on coinductive resumptions (Q5971399) (← links)
- Reversible monadic computing (Q5971401) (← links)
- Healthiness conditions for predicate transformers (Q5971403) (← links)
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness (Q6077384) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6093581) (← links)
- Flexibly graded monads and graded algebras (Q6109207) (← links)
- Hypernormalisation in an abstract setting (Q6116181) (← links)
- Plethysms and operads (Q6141135) (← links)
- Divergences on monads for relational program logics (Q6149935) (← links)
- Promonads and String Diagrams for Effectful Categories (Q6150166) (← links)
- Galois connecting call-by-value and call-by-name (Q6151562) (← links)
- Protocol choice and iteration for the free cornering (Q6151626) (← links)
- Distributive laws for relative monads (Q6159707) (← links)
- A dependent dependency calculus (Q6166797) (← links)
- The formal theory of relative monads (Q6496517) (← links)
- Compositional probabilistic model checking with string diagrams of MDPs (Q6535679) (← links)
