scientific article; zbMATH DE number 1223609
From MaRDI portal
Publication:4218919
zbMath0908.03035MaRDI QIDQ4218919
Publication date: 15 November 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
2-person games (91A05) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30)
Related Items
Polarized games, Games for Dependent Types, Game Semantics in the Nominal Model, Game semantics for dependent types, Unnamed Item, Algorithmic games for full ground references, Realizability for Peano arithmetic with winning conditions in HON games, Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects, Game theoretic analysis of call-by-value computation, Full abstraction for Reduced ML, Interpreting Localized Computational Effects Using Operators of Higher Type, Resource modalities in tensor logic, Block structure vs scope extrusion: between innocence and omniscience, Game-theoretic analysis of call-by-value computation, ML and Extended Branching VASS, Unnamed Item, Local variable scoping and Kleene algebra with tests, Algorithmic Nominal Game Semantics, Leafy automata for higher-order concurrency, Complete trace models of state and control, Bayesian strategies: probabilistic programs as generalised graphical models, A Fragment of ML Decidable by Visibly Pushdown Automata, Algorithmic probabilistic game semantics. Playing games with automata, A game semantics of names and pointers, Infinite trace equivalence, Regular-Language Semantics for a Call-by-Value Programming Language, A Game Semantics of Idealized CSP, Global State Considered Helpful, Towards Nominal Abramsky, Game semantics and linear CPS interpretation, Functions with local state: regularity and undecidability, A relational account of call-by-value sequentiality, Full Abstraction for Reduced ML, Some Programming Languages Suggested by Game Models (Extended Abstract), An Algebraic Account of References in Game Semantics, Game Semantics for Bounded Polymorphism, Unnamed Item, Locally Boolean domains, Games for complexity of second-order call-by-name programs, Games and full abstraction for FPC., On full abstraction for PCF: I, II and III, Program equivalence in linear contexts
