The following pages link to (Q5144664):
Displayed 13 items.
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Quantitative logics for equivalence of effectful programs (Q2133179) (← links)
- Combining algebraic effect descriptions using the tensor of complete lattices (Q2133480) (← links)
- The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- (Q5020616) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular (Q5079754) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6093581) (← links)
- Streams of approximations, equivalence of recursive effectful programs (Q6109211) (← links)
- Runners for interleaving algebraic effects (Q6164485) (← links)