The following pages link to Definability and full abstraction (Q2864154):
Displaying 13 items.
- Fully abstract trace semantics for protected module architectures (Q1749116) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Some programming languages suggested by game models (extended abstract) (Q2805154) (← links)
- Full abstraction for nominal Scott domains (Q2931777) (← links)
- Full abstraction, totality and PCF (Q4237906) (← links)
- A Higher-Order Calculus of Computational Fields (Q4617982) (← links)
- Full Abstraction and the Context Lemma (Q4887022) (← links)
- (Q5079748) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
- Normal forms, linearity, and prime algebraicity over nonflat domains (Q5109211) (← links)
- Observable interface behaviour and inheritance (Q5741571) (← links)
- On the reification of semantic linearity (Q5741580) (← links)
- The far side of the cube. An elementary introduction to game semantics (Q6612782) (← links)
