The following pages link to Notions of computation and monads (Q757075):
Displaying 50 items.
- Normalization by evaluation and algebraic effects (Q265792) (← links)
- Monads for behaviour (Q265824) (← links)
- Freyd categories are enriched Lawvere theories (Q280202) (← links)
- The coinductive resumption monad (Q283770) (← links)
- Semantics of higher-order quantum computation via geometry of interaction (Q345711) (← links)
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects (Q345713) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- Algebraic properties of stochastic effectivity functions (Q406467) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Constructive Boolean circuits and the exactness of timed ternary simulation (Q453539) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- Modes of adjointness (Q484110) (← links)
- Observationally-induced lower and upper powerspace constructions (Q492906) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code (Q532398) (← links)
- VDM semantics of programming languages: Combinators and monads (Q539163) (← links)
- Constructing language processors with algebra combinators (Q608238) (← links)
- Monad transformers as monoid transformers (Q615955) (← links)
- Cartesian effect categories are Freyd-categories (Q631572) (← links)
- Resource modalities in tensor logic (Q636303) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Principles of programming with complex objects and collection types (Q672333) (← links)
- A theory of binding structures and applications to rewriting (Q685380) (← links)
- Eager and delayed contract monitoring for call-by-value and call-by-name evaluation (Q710673) (← links)
- A formal abstract framework for modelling and testing complex software systems (Q714878) (← links)
- Cut-free Gentzen calculus for multimodal CK (Q764259) (← links)
- Extending separation logic with fixpoints and postponed substitution (Q820139) (← links)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- About permutation algebras, (pre)sheaves and named sets (Q853745) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Eilenberg--Moore algebras for stochastic relations (Q859832) (← links)
- Generic models for computational effects (Q860841) (← links)
- Discrete Lawvere theories and computational effects (Q860883) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Dijkstra and Hoare monads in monadic computation (Q890377) (← links)
- Commutativity (Q899553) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Comparing free algebras in topological and classical domain theory (Q964484) (← links)
- Modules over monads and initial semantics (Q964503) (← links)
- A generic complete dynamic logic for reasoning about purity and effects (Q973056) (← links)
- The proof monad (Q974136) (← links)
- Kleisli morphisms and randomized congruences for the Giry monad (Q995624) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
