The following pages link to Full abstraction for PCF (Q1854394):
Displaying 50 items.
- On concurrent games with payoff (Q265795) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Semantics of higher-order quantum computation via geometry of interaction (Q345711) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- A graphical foundation for interleaving in game semantics (Q479313) (← links)
- Preface to the special volume (Q534064) (← links)
- Musings around the geometry of interaction, and coherence (Q534708) (← links)
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Resource modalities in tensor logic (Q636303) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- The extensional ordering of the sequential functionals (Q764278) (← links)
- Syntactic control of concurrency (Q817845) (← links)
- A calculus of coroutines (Q817847) (← links)
- Multigames and strategies, coalgebraically (Q890378) (← links)
- A type assignment system for game semantics (Q930873) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Linearity and bisimulation (Q997996) (← links)
- Toward the interpretation of non-constructive reasoning as non-monotonic learning (Q1004290) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- Natural non-dcpo domains and f-spaces (Q1023300) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- The category of node-and-choice preforms for extensive-form games (Q1615994) (← links)
- Game semantics for dependent types (Q1641014) (← links)
- Verifying annotated program families using symbolic game semantics (Q1680558) (← links)
- Game semantics and linear CPS interpretation (Q1770417) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Games characterizing Levy-Longo trees (Q1884875) (← links)
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
- Polarized games (Q1886321) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Deterministic concurrent strategies (Q1941878) (← links)
- Constructive hybrid games (Q2096468) (← links)
- Continuous probability distributions in concurrent games (Q2134837) (← links)
- A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
- Weighted models for higher-order computation (Q2216134) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- A game-semantic model of computation (Q2319854) (← links)
