The following pages link to (Q4813222):
Displayed 19 items.
- Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces (Q431707) (← links)
- Programming with algebraic effects and handlers (Q478396) (← links)
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language (Q541217) (← links)
- Reasoning about conditional probabilities in a higher-order-logic theorem prover (Q545151) (← links)
- Monad transformers as monoid transformers (Q615955) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Modules over monads and initial semantics (Q964503) (← links)
- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language (Q1023294) (← links)
- The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
- Trace semantics via determinization (Q2341701) (← links)
- Combining effects: sum and tensor (Q2500483) (← links)
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← links)
- Comonadic Notions of Computation (Q2873672) (← links)
- Relating Computational Effects by ⊤ ⊤-Lifting (Q3012918) (← links)
- Counting Successes: Effects and Transformations for Non-deterministic Programs (Q3188280) (← links)
- Interleaving data and effects (Q5371955) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6093581) (← links)