The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- Comprehending Ringads (Q3188283) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- (Q3384909) (← links)
- Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
- A System F with Call-by-Name Exceptions (Q3519511) (← links)
- Monad compositions II: Kleisli strength (Q3520147) (← links)
- Asymptotic Improvement of Computations over Free Monads (Q3521997) (← links)
- Sequential real number computation and recursive relations (Q3528145) (← links)
- Logical relations for monadic types (Q3545276) (← links)
- Transactional events (Q3546046) (← links)
- Hoare type theory, polymorphism and separation (Q3546051) (← links)
- Selection functions, bar recursion and backward induction (Q3559969) (← links)
- Coherence for monoidal endofunctors (Q3583019) (← links)
- Coherence for monoidal monads and comonads (Q3583020) (← links)
- Realisability semantics of parametric polymorphism, general references and recursive types (Q3583027) (← links)
- Coherence of subsumption for monadic types (Q3616445) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (Q3617747) (← links)
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
- Monadic Translation of Intuitionistic Sequent Calculus (Q3638248) (← links)
- The Arrow Calculus as a Quantum Programming Language (Q3638297) (← links)
- Gabriel–Ulmer duality and Lawvere theories enriched over a general base (Q3638917) (← links)
- Parameterised notions of computation (Q3638920) (← links)
- The essence of the <scp>Iterator</scp> pattern (Q3638921) (← links)
- Enriching an Effect Calculus with Linear Types (Q3644752) (← links)
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages (Q3644934) (← links)
- THE Σλ-CALCULUS AND DERIVED PROGRAM FORMS (Q3980023) (← links)
- \(\lambda{} \sigma\): A simulation language based on the typed \(\lambda\)- calculus (Q3992063) (← links)
- (Q4222932) (← links)
- Comprehending monads (Q4279255) (← links)
- Partial hyperdoctrines: categorical models for partial function logic and Hoare logic (Q4302334) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- Traced Premonoidal Categories (Q4460686) (← links)
- Encoding FIX in Object Calculi (Q4494479) (← links)
- Codensity Lifting of Monads and its Dual (Q4553284) (← links)
- Quotienting the delay monad by weak bisimilarity (Q4559601) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- Computation semantics of the functional scientific workflow language Cuneiform (Q4577807) (← links)
- Contributions to a computational theory of policy advice and avoidability (Q4577808) (← links)
- (Q4585073) (← links)
- (Q4611382) (← links)
- Notions of computation as monoids (Q4625158) (← links)
- (Q4637688) (← links)
- (Q4668854) (← links)
- Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
- Sound and complete axiomatisations of call-by-value control operators (Q4882487) (← links)
- Regular-Language Semantics for a Call-by-Value Programming Language (Q4917052) (← links)
- Pseudo-commutative Monads (Q4917057) (← links)
- Semantics for Algebraic Operations (Q4917064) (← links)
- A typed, algebraic, computational lambda-calculus (Q4917199) (← links)
