scientific article; zbMATH DE number 1231510
From MaRDI portal
Publication:4222822
Recommendations
Cited in
(48)- Full abstraction for idealized Algol with passive expressions
- Game semantics and linear CPS interpretation
- Games and full abstraction for FPC.
- On full abstraction for PCF: I, II and III
- Objects and classes in Algol-like languages
- The regular-language semantics of second-order idealized ALGOL
- An approach to deciding the observational equivalence of Algol-like languages
- Game-theoretic analysis of call-by-value computation
- Latent semantic analysis of game models using LSTM
- A game semantics of names and pointers
- Decidability and syntactic control of interference
- Automata-theoretic semantics of idealized Algol with passive expressions
- On the semantics of the bad-variable constructor in Algol-like languages
- An algebraic account of references in game semantics
- Contextual approximation and higher-order procedures
- A categorical semantics of higher order store
- Processes and games
- Definability and full abstraction
- Block structure vs scope extrusion: between innocence and omniscience
- From qualitative to quantitative semantics. By change of base
- A truly concurrent game model of the asynchronous -calculus
- A fragment of ML decidable by visibly pushdown automata
- Constructing Differential Categories and Deconstructing Categories of Games
- An automata-theoretic model of Idealized Algol (extended abstract)
- Understanding game semantics through coherence spaces
- Modelling local variables: possible worlds and object spaces
- Full abstraction without synchronization primitives
- A system-level game semantics
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Bad Variables Under Control
- Compositional Predicate Abstraction from Game Semantics
- scientific article; zbMATH DE number 4011906 (Why is no real title available?)
- Imperative programs as proofs via game semantics
- Game theoretic analysis of call-by-value computation
- Regular-language semantics for a call-by-value programming language
- A Game Semantics of Idealized CSP
- The geometry of Bayesian programming
- A fully abstract game semantics for countable nondeterminism
- scientific article; zbMATH DE number 7204431 (Why is no real title available?)
- Polymorphic game semantics for dynamic binding
- Global state considered helpful
- Capsules and closures
- Finitary PCF is not decidable
- Totality in arena games
- The far side of the cube. An elementary introduction to game semantics
- An axiomatic account of a fully abstract game semantics for general references
- Deconstructing general references via game semantics
- Local variable scoping and Kleene algebra with tests
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222822)
