The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- Sequential Real Number Computation and Recursive Relations (Q4918036) (← links)
- Causal commutative arrows (Q4918242) (← links)
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
- Presheaf Models of Quantum Computation: An Outline (Q4922081) (← links)
- A graphical approach to monad compositions (Q4923371) (← links)
- A Superposition Operator for the Refinement of Algebraic Models (Q4923378) (← links)
- Models for the computational λ-calculus (Q4923379) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- (Q4968384) (← links)
- THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT (Q4977221) (← links)
- Dynamic game semantics (Q4988428) (← links)
- Ambiguity and Incomplete Information in Categorical Models of Language (Q5014785) (← links)
- Total and Partial Computation in Categorical Quantum Foundations (Q5015192) (← links)
- (Q5018484) (← links)
- From curves to currents (Q5018888) (← links)
- Gradual type theory (Q5019016) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- (Q5019656) (← links)
- The linear-non-linear substitution 2-monad (Q5019678) (← links)
- (Q5019687) (← links)
- (Q5020559) (← links)
- (Q5020617) (← links)
- Runners in Action (Q5041086) (← links)
- Monads, indexes and transformations (Q5044745) (← links)
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages (Q5049000) (← links)
- Synthetic topology in Homotopy Type Theory for probabilistic programming (Q5055499) (← links)
- Partiality and Container Monads (Q5056003) (← links)
- The costructure–cosemantics adjunction for comodels for computational effects (Q5058362) (← links)
- Weakest preconditions in fibrations (Q5058365) (← links)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
- Convexity via Weak Distributive Laws (Q5060194) (← links)
- Finitary monads on the category of posets (Q5068206) (← links)
- Metric monads (Q5076388) (← links)
- The geometry of Bayesian programming (Q5076392) (← links)
- Relating Structure and Power: Comonadic Semantics for Computational Resources (Q5079721) (← links)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability (Q5089294) (← links)
- (Q5094129) (← links)
- Formal categorical reasoning (Q5102205) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- Continuation passing style for effect handlers (Q5111314) (← links)
- (Q5119390) (← links)
- Local algebraic effect theories (Q5120228) (← links)
- (Q5129941) (← links)
- (Q5155672) (← 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)
- Modalities in homotopy type theory (Q5208873) (← links)
- LF+ in Coq for "fast and loose" reasoning (Q5210657) (← links)
- (Q5214814) (← links)
