The following pages link to Notions of computation and monads (Q757075):
Displaying 19 items.
- Asymptotic speedup via effect handlers (Q6561531) (← links)
- Why adjunctions matter -- a functional programmer perspective (Q6562512) (← links)
- A step-indexing approach to partial functions (Q6587252) (← links)
- Signature restriction for polymorphic algebraic effects (Q6594243) (← links)
- Substructural nuclear (image-based) logics and operational Kripke-style semantics (Q6597128) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)
- Enriching diagrams with algebraic operations (Q6629455) (← links)
- Sum and tensor of quantitative effects (Q6635519) (← links)
- Compositional reversible computation (Q6637582) (← links)
- Varieties of quantitative algebras and their monads (Q6649438) (← links)
- Probability monads with submonads of deterministic states (Q6649470) (← links)
- Beyond nonexpansive operations in quantitative algebraic reasoning (Q6649487) (← links)
- Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction (Q6649494) (← links)
- Monads for measurable queries in probabilistic databases (Q6653746) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6653755) (← links)
- Two guarded recursive powerdomains for applicative simulation (Q6653758) (← links)
- Inductive and coinductive predicate liftings for effectful programs (Q6653761) (← links)
- Canonical automata via distributive law homomorphisms (Q6653763) (← links)
- Correspondence between composite theories and distributive laws (Q6666781) (← links)
