The following pages link to Computer Science Logic (Q5394571):
Displaying 11 items.
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- Deriving logical relations from interpretations of predicate logic (Q2133176) (← links)
- Weakest preconditions in fibrations (Q2133463) (← links)
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics (Q2134832) (← links)
- Algebras for Parameterised Monads (Q2888473) (← links)
- Relating Computational Effects by ⊤ ⊤-Lifting (Q3012918) (← links)
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators (Q3540185) (← links)
- Codensity Lifting of Monads and its Dual (Q4553284) (← links)
- Weakest preconditions in fibrations (Q5058365) (← links)
- Relational Parametricity for Control Considered as a Computational Effect (Q5262944) (← links)
- A fibrational tale of operational logical relations: pure, effectful and differential (Q6563048) (← links)
