The following pages link to (Q4072829):
Displaying 24 items.
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Semantics of interference control (Q759473) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- Strictness analysis and denotational abstract interpretation (Q1098274) (← links)
- The congruence of two programming language definitions (Q1155952) (← links)
- Chain properties in Pomega (Q1157698) (← links)
- Recursive types for Fun (Q1176245) (← links)
- Fully abstract models of typed \(\lambda\)-calculi (Q1249567) (← links)
- Fixed-point constructions in order-enriched categories (Q1255084) (← links)
- Kleene's Logic with equality (Q1603370) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics (Q2134832) (← links)
- An adequacy theorem for dependent type theory (Q2311883) (← links)
- Morphism axioms (Q2402279) (← links)
- State-transition machines for lambda-calculus expressions (Q2464714) (← links)
- State-transition machines, revisited (Q2464722) (← links)
- Syntactic logical relations for polymorphic and recursive types (Q2864153) (← links)
- (Q4175259) (← links)
- Computational adequacy via ‘mixed’ inductive definitions (Q5890041) (← links)
- On the transformation between direct and continuation semantics (Q5890072) (← links)
- Galois connecting call-by-value and call-by-name (Q6151562) (← links)
