On the public citation graph

Call-by-value games

https://doi.org/10.1007/bfb0028004
0 signed · 141 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1007/3-540-53487-3_58openalex-snapshot
Relating full abstraction results for different programming languages
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1007/3-540-58140-5_25openalex-snapshot
Hereditarily sequential functionals
inferredcites →https://doi.org/10.1007/3-540-63165-8_180openalex-snapshot
Game theoretic analysis of call-by-value computation
inferredcites →https://doi.org/10.1007/978-1-4471-0615-9openalex-snapshot
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_11openalex-snapshot
Syntactic Control of Interference
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_4openalex-snapshot
The Essence of Algol
inferredcites →https://doi.org/10.1007/978-1-4757-3851-3_10openalex-snapshot
Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions
inferredcites →https://doi.org/10.1007/bfb0084215openalex-snapshot
Algebraically complete categories
inferredcites →https://doi.org/10.1016/0168-0072(94)90020-5openalex-snapshot
Semantics of weakening and contraction
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/s0304-3975(99)00039-0openalex-snapshot
Game-theoretic analysis of call-by-value computation
inferredcites →https://doi.org/10.1017/cbo9780511526565openalex-snapshot
Axiomatic Domain Theory in Categories of Partial Maps
inferredcites →https://doi.org/10.1017/s0960129597002375openalex-snapshot
Premonoidal categories and notions of computation
inferredcites →https://doi.org/10.1109/lics.1990.113772openalex-snapshot
Recursive types reduced to inductive types
inferredcites →https://doi.org/10.1109/lics.1994.316083openalex-snapshot
An axiomatisation of computationally adequate domain theoretic models of FPC
inferredcites →https://doi.org/10.1109/lics.1996.561316openalex-snapshot
Games and full abstraction for FPC
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference
inferredcites →https://doi.org/10.17863/cam.15863openalex-snapshot
Names and higher-order functions.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1999.2845openalex-snapshot
Games and Full Abstraction for FPC
inferred← citeshttps://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferred← citeshttps://doi.org/10.1006/inco.2002.2957openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.1007/11783596_5openalex-snapshot
Relational Semantics for Higher-Order Programs
inferred← citeshttps://doi.org/10.1007/11828563_5openalex-snapshot
Local Variable Scoping and Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_20openalex-snapshot
A Game Semantics of Linearly Used Continuations
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_17openalex-snapshot
Call-by-Push-Value: A Subsuming Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_180openalex-snapshot
Game theoretic analysis of call-by-value computation
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_10openalex-snapshot
Leafy automata for higher-order concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_13openalex-snapshot
Complete trace models of state and control
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_19openalex-snapshot
Bayesian strategies: probabilistic programs as generalised graphical models
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_7openalex-snapshot
An Axiomatic Account of a Fully Abstract Game Semantics for General References
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_8openalex-snapshot
Deconstructing General References via Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_25openalex-snapshot
On Bar Recursion and Choice in a Classical Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_5openalex-snapshot
Intensionality, Definability and Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_23openalex-snapshot
Call-by-Value in a Basic Logic for Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_17openalex-snapshot
Decision Algorithms for Checking Definability of Order-2 Finitary PCF
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_4openalex-snapshot
A Syntactic View of Computational Adequacy
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_6openalex-snapshot
Propositional Dynamic Logic for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_21openalex-snapshot
A Game Semantics of Local Names and Good Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_42openalex-snapshot
Interpreting Localized Computational Effects Using Operators of Higher Type
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_23openalex-snapshot
Typed Normal Form Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_23openalex-snapshot
Verification of Higher-Order Computation: A Game-Semantic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_4openalex-snapshot
Full Abstraction for Reduced ML
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_4openalex-snapshot
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_22openalex-snapshot
Algorithmic Nominal Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_22openalex-snapshot
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_11openalex-snapshot
A Fragment of ML Decidable by Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_63openalex-snapshot
Hector: An Equivalence Checker for a Higher-Order Fragment of ML
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_30openalex-snapshot
Algorithmic Games for Full Ground References
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_16openalex-snapshot
Deconstructing General References via Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_17openalex-snapshot
Towards Nominal Abramsky
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_8openalex-snapshot
Realizability for Peano Arithmetic with Winning Conditions in HON Games
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_1openalex-snapshot
Game Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_16openalex-snapshot
Fragments of ML Decidable by Nested Data Class Memory Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_3openalex-snapshot
Games for Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_4openalex-snapshot
Game Semantics for Bounded Polymorphism
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_12openalex-snapshot
ML and Extended Branching VASS
inferred← citeshttps://doi.org/10.1007/978-94-007-0954-6openalex-snapshot
Call-By-Push-Value
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_2openalex-snapshot
Algorithmic Game Semantics
inferred← citeshttps://doi.org/10.1007/bfb0029944openalex-snapshot
Game semantics for programming languages
inferred← citeshttps://doi.org/10.1007/s10703-012-0173-1openalex-snapshot
Algorithmic probabilistic game semantics
inferred← citeshttps://doi.org/10.1007/s10703-017-0292-9openalex-snapshot
Algorithmic games for full ground references
inferred← citeshttps://doi.org/10.1016/b978-0-444-51726-5.50017-0openalex-snapshot
INFORMATION, PROCESSES AND GAMES
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.006openalex-snapshot
A game semantics of names and pointers
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.007openalex-snapshot
Infinite trace equivalence
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.018openalex-snapshot
Resource modalities in tensor logic
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.006openalex-snapshot
Realizability for Peano arithmetic with winning conditions in HON games
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.011openalex-snapshot
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.057openalex-snapshot
Asynchronous Games 3 An Innocent Model of Linear Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.069openalex-snapshot
Infinite Trace Equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.015openalex-snapshot
Global State Considered Helpful
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.087openalex-snapshot
Some Programming Languages Suggested by Game Models (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.099openalex-snapshot
An Algebraic Account of References in Game Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.012openalex-snapshot
Game Semantics in the Nominal Model
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.015openalex-snapshot
Game semantics for dependent types
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.007openalex-snapshot
Local variable scoping and Kleene algebra with tests
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.022openalex-snapshot
Game semantics and linear CPS interpretation
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.036openalex-snapshot
Functions with local state: Regularity and undecidability
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.05.013openalex-snapshot
Games for complexity of second-order call-by-name programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.007openalex-snapshot
Locally Boolean domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.006openalex-snapshot
Program equivalence in linear contexts
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00353-4openalex-snapshot
Innocent game models of untyped λ-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00039-0openalex-snapshot
Game-theoretic analysis of call-by-value computation
inferred← citeshttps://doi.org/10.1016/s1571-0661(03)50009-3openalex-snapshot
On the Semantics of the Bad-Variable Constructor in Algol-like Languages
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80568-1openalex-snapshot
Adjunction Models For Call-By-Push-Value With Stacks
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80958-7openalex-snapshot
Regular-Language Semantics for a Call-by-Value Programming Language
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80965-4openalex-snapshot
A Game Semantics of Idealized CSP
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82528-9openalex-snapshot
Processes and Games
inferred← citeshttps://doi.org/10.1017/s0960129523000154openalex-snapshot
Game semantics of Martin-Löf type theory
inferred← citeshttps://doi.org/10.1023/a:1020891112409openalex-snapshot
Linear Continuation-Passing
inferred← citeshttps://doi.org/10.1109/lics.1998.705669openalex-snapshot
A fully abstract game semantics for general references
inferred← citeshttps://doi.org/10.1109/lics.1998.705670openalex-snapshot
Recursive types in games: axiomatics and process representation
inferred← citeshttps://doi.org/10.1109/lics.1999.782639openalex-snapshot
Non-deterministic games and program analysis: An application to security
inferred← citeshttps://doi.org/10.1109/lics.2000.855770openalex-snapshot
Probabilistic game semantics
inferred← citeshttps://doi.org/10.1109/lics.2001.932487openalex-snapshot
A fully abstract game semantics of local exceptions
inferred← citeshttps://doi.org/10.1109/lics.2002.1029835openalex-snapshot
Polarized games
inferred← citeshttps://doi.org/10.1109/lics.2003.1210050openalex-snapshot
On program equivalence in languages with ground-type references
inferred← citeshttps://doi.org/10.1109/lics.2004.27openalex-snapshot
Nominal games and full abstraction for the nu-calculus
inferred← citeshttps://doi.org/10.1109/lics.2007.41openalex-snapshot
Resource modalities in game semantics
inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferred← citeshttps://doi.org/10.1109/lics.2011.31openalex-snapshot
Game Semantics for Good General References
inferred← citeshttps://doi.org/10.1109/lics.2011.32openalex-snapshot
Isomorphisms of Types in the Presence of Higher-Order References
inferred← citeshttps://doi.org/10.1109/lics.2015.20openalex-snapshot
Game Semantics for Type Soundness
inferred← citeshttps://doi.org/10.1109/lics.2015.58openalex-snapshot
Parallelism and Synchronization in an Infinitary Context
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175791openalex-snapshot
Operational Algorithmic Game Semantics
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00046openalex-snapshot
Reachability Types, Traces and Full Abstraction
inferred← citeshttps://doi.org/10.1145/1094622.1094626openalex-snapshot
About the undecidability of program equivalence in finitary languages with state
inferred← citeshttps://doi.org/10.1145/2034574.2034800openalex-snapshot
Temporal higher-order contracts
inferred← citeshttps://doi.org/10.1145/2948896.2948902openalex-snapshot
An invitation to game semantics
inferred← citeshttps://doi.org/10.1145/3290345openalex-snapshot
Game semantics for quantum programming
inferred← citeshttps://doi.org/10.1145/3310338openalex-snapshot
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1145/3622758openalex-snapshot
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
inferred← citeshttps://doi.org/10.1145/3622758.3622884openalex-snapshot
Sharing a Perspective on the 𝜆-Calculus
inferred← citeshttps://doi.org/10.1145/3765737openalex-snapshot
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF
inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot
Domain-Theoretic Semantics for Functional Logic Programming
inferred← citeshttps://doi.org/10.1145/507382.507385openalex-snapshot
Probabilistic game semantics
inferred← citeshttps://doi.org/10.1145/981009.981013openalex-snapshot
A survey of semantic description frameworks for programming languages
inferred← citeshttps://doi.org/10.11575/prism/21518openalex-snapshot
EII-polycategories, additive linear logic, and process semantics
inferred← citeshttps://doi.org/10.1561/2500000017openalex-snapshot
Nominal Game Semantics
inferred← citeshttps://doi.org/10.17863/cam.61919openalex-snapshot
Probabilistic concurrent game semantics
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:3)2016openalex-snapshot
Block structure vs scope extrusion: between innocence and omniscience
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:8)2012openalex-snapshot
Isomorphisms of types in the presence of higher-order references (extended version)
inferred← citeshttps://doi.org/10.2307/421149openalex-snapshot
Games and Definability For FPC
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:3)2019openalex-snapshot
Probabilistic call by push value
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cc7openalex-snapshot
Leafy automata for higher-order concurrency
inferred← citeshttps://doi.org/10.4204/eptcs.127.8openalex-snapshot
Combining and Relating Control Effects and their Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.0705.0462openalex-snapshot
Resource modalities in game semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1505.03635openalex-snapshot
Parallelism and Synchronization in an Infinitary Context (Long Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1508.05023openalex-snapshot
Games for Dependent Types
inferred← citeshttps://doi.org/10.48550/arxiv.1601.05336openalex-snapshot
Game-theoretic Interpretation of Intuitionistic Type Theory
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08491openalex-snapshot
Complete trace models of state and control
inferred← citeshttps://doi.org/10.48550/arxiv.2104.13979openalex-snapshot
Semantic Bounds and Strong Call-by-Value Normalization
inferred← citeshttps://doi.org/10.5287/ora-e9ne8n0zropenalex-snapshot
Game semantics based equivalence checking of higher-order programs
inferred← citeshttps://doi.org/10.70675/1fe9d40fzc796z4fb8zbc8fz98a158e7d52aopenalex-snapshot
Quantum Game Semantics
inferred← citeshttps://doi.org/10.70675/2c4422f8z1cafz4e76z85e9z4ba8ed705623openalex-snapshot
Game semantics and realizability for classical logic
inferred← citeshttps://doi.org/10.70675/4714cfc0z7540z46edz8647z654a35f388b1openalex-snapshot
A logical study of program equivalence
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0007openalex-snapshot
Axioms for Definability and Full Completeness
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.