Call-by-value games

DOI10.1007/BFB0028004MaRDI QIDQ4218919zbMATH OpenFDO

Authors Samson Abramsky, Guy McCusker

Publication date 15 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028004

zbMATH Keywords

categories of gamesconstruction of models of call-by-value from models of call-by-name computation

Mathematics Subject Classification ID

Logic in computer science (03B70) Categorical logic, topoi (03G30) Semantics in the theory of computing (68Q55) 2-person games (91A05)

Recommendations

• Game theoretic analysis of call-by-value computation
• Game-theoretic analysis of call-by-value computation
• Game semantics for call-by-value polymorphism
• Full abstraction for PCF

Cited in

(49)

• Game semantics for dependent types
• Algorithmic games for full ground references
• Game semantics and linear CPS interpretation
• Games and full abstraction for FPC.
• On full abstraction for PCF: I, II and III
• Polarized games
• Game-theoretic analysis of call-by-value computation
• Leafy automata for higher-order concurrency
• Complete trace models of state and control
• Bayesian strategies: probabilistic programs as generalised graphical models
• Algorithmic probabilistic game semantics. Playing games with automata
• Program equivalence in linear contexts
• A game semantics of names and pointers
• Infinite trace equivalence
• A relational account of call-by-value sequentiality
• Locally Boolean domains
• Games for complexity of second-order call-by-name programs
• Call-by-value in a basic logic for interaction
• Some programming languages suggested by game models (extended abstract)
• An algebraic account of references in game semantics
• Game semantics for bounded polymorphism
• Block structure vs scope extrusion: between innocence and omniscience
• ML and extended branching VASS
• Algorithmic nominal game semantics
• A fragment of ML decidable by visibly pushdown automata
• Game semantics in the nominal model
• Games for dependent types
• 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
• Interpreting Localized Computational Effects Using Operators of Higher Type
• Full Abstraction for Reduced ML
• Full abstraction for Reduced ML
• Game theoretic analysis of call-by-value computation
• Probabilistic call by push value
• scientific article; zbMATH DE number 2120508 (Why is no real title available?)
• Regular-language semantics for a call-by-value programming language
• A Game Semantics of Idealized CSP
• Towards nominal Abramsky
• Combining and relating control effects and their semantics
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• Global state considered helpful
• Functions with local state: regularity and undecidability
• Resource modalities in tensor logic
• An axiomatic account of a fully abstract game semantics for general references
• Deconstructing general references via game semantics
• A tale of additives and concurrency in game semantics
• Factorize factorization
• Fully abstract normal form bisimulation for call-by-value PCF
• Local variable scoping and Kleene algebra with tests

This page was built for publication: Call-by-value games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218919)