The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← links)
- Implication via spacetime (Q2658280) (← links)
- C-system of a module over a \(Jf\)-relative monad (Q2689172) (← links)
- Domain-free \(\lambda\mu\)-calculus (Q2729625) (← links)
- On equation systems in monotonic models of typed \(\lambda\)-calculus (Q2765372) (← links)
- Game semantics for access control (Q2805155) (← links)
- Categories of timed stochastic relations (Q2805158) (← links)
- Two cotensors in one: presentations of algebraic theories for local state and fresh names (Q2805171) (← links)
- Dependent Types and Fibred Computational Effects (Q2811331) (← links)
- Introducing a Calculus of Effects and Handlers for Natural Language Semantics (Q2835059) (← links)
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs (Q2842817) (← links)
- Adjunction models for call-by-push-value with stacks (Q2842825) (← links)
- Access control in a core calculus of dependency (Q2864145) (← links)
- A convenient category of domains (Q2864147) (← links)
- The category theoretic understanding of universal algebra: Lawvere theories and monads (Q2864158) (← links)
- Structuring operational semantics: simplification and computation (Q2864160) (← links)
- Quantum arrows in Haskell (Q2870213) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- Specifying properties of concurrent computations in CLF (Q2871839) (← links)
- Comonadic notions of computation (Q2873672) (← links)
- Delimited control and computational effects (Q2875223) (← links)
- Algebras for Parameterised Monads (Q2888473) (← links)
- Kleene Monads: Handling Iteration in a Framework of Generic Effects (Q2888474) (← links)
- Complete Iterativity for Algebras with Effects (Q2888475) (← links)
- Coalgebraic Components in a Many-Sorted Microcosm (Q2888477) (← links)
- A Semantical Approach to Equilibria and Rationality (Q2888496) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- A duality between exceptions and states (Q2909735) (← links)
- Categorifying computations into components via arrows as profunctors (Q2919448) (← links)
- Families of symmetries as efficient models of resource binding (Q2919450) (← links)
- Notions of Bidirectional Computation and Entangled State Monads (Q2941175) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- Dijkstra Monads in Monadic Computation (Q2942780) (← links)
- No-iteration mixed distributive laws (Q2973244) (← links)
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
- Equational Theories of Abnormal Termination Based on Kleene Algebra (Q2988362) (← links)
- Unifying Guarded and Unguarded Iteration (Q2988389) (← links)
- Commutative Semantics for Probabilistic Programming (Q2988671) (← links)
- Traces for coalgebraic components (Q3005989) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Roles, stacks, histories: A triple for Hoare (Q3021420) (← links)
- Weak bisimulations for the Giry monad (Q3060190) (← links)
- The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197) (← links)
- A Coinductive Calculus for Asynchronous Side-Effecting Processes (Q3088290) (← links)
- A Nominal Relational Model for Local Store (Q3178267) (← links)
- Observationally-induced Effects in Cartesian Closed Categories (Q3178272) (← links)
- A Simply Typed λ-Calculus of Forward Automatic Differentiation (Q3178288) (← links)
- Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
- Logic in Access Control (Tutorial Notes) (Q3184786) (← links)
- Embedding Constructive K into Intuitionistic K (Q3185769) (← links)
