Pages that link to "Item:Q1854393"

The following pages link to On full abstraction for PCF: I, II and III (Q1854393):

Displaying 50 items.

• On concurrent games with payoff (Q265795) (← links)
• Computation by interaction for space-bounded functional programming (Q276265) (← links)
• Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
• Semantics of higher-order quantum computation via geometry of interaction (Q345711) (← links)
• Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects (Q345713) (← 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)
• An approach to innocent strategies as graphs (Q418201) (← links)
• A synthetic theory of sequential domains (Q424548) (← 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)
• Program verification using symbolic game semantics (Q477213) (← 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)
• On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras (Q481102) (← links)
• Preface to the special volume (Q534064) (← links)
• Computational ludics (Q534713) (← links)
• Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← 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)
• A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← 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)
• Totality in arena games (Q636307) (← links)
• Games with 1-backtracking (Q636360) (← links)
• Interaction graphs: multiplicatives (Q714715) (← 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)
• 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)
• From Hilbert's program to a logic tool box (Q1028646) (← links)
• Glueing and orthogonality for models of linear logic (Q1398466) (← links)
• Exhausting strategies, joker games and full completeness for IMLL with unit (Q1398468) (← links)
• Parallel and serial hypercoherences (Q1583243) (← 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)
• Classical realizability in the CPS target language (Q1744381) (← links)
• Game semantics and linear CPS interpretation (Q1770417) (← links)
• The sequentially realizable functionals (Q1849853) (← links)