The following pages link to (Q3932278):
Displaying 27 items.
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Monoidal indeterminates and categories of possible worlds (Q418809) (← links)
- The spirit of ghost code (Q518394) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- Semantics of interference control (Q759473) (← links)
- Constraint-based relational verification (Q832229) (← links)
- Splitting atoms safely (Q879357) (← links)
- Relational separation logic (Q879369) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- An operational semantics of occam (Q914399) (← links)
- Proof obligations for blocks and procedures (Q919838) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- A categorical treatment of pre- and post-conditions (Q1093363) (← links)
- A note on undefined expression values in programming logics (Q1093365) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Auxiliary variables in data refinement (Q1114384) (← links)
- Continuations in possible-world semantics (Q1178704) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- The regular-language semantics of second-order idealized ALGOL (Q1884909) (← links)
- On assertion-based encapsulation for object invariants and simulations (Q2643129) (← links)
- Monoidal indeterminates and categories of possible worlds (Q2805149) (← links)
- Compositional Predicate Abstraction from Game Semantics (Q3617753) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)
