On the public citation graph
Nominal Game Semantics
0 signed · 82 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferredcites →https://doi.org/10.1007/10722010_15openalex-snapshot
A Metalanguage for Programming with Bound Names Modulo Renaming
inferredcites →https://doi.org/10.1007/3-540-45022-x_10openalex-snapshot
Reasoning about Idealized ALGOL Using Regular Languages
inferredcites →https://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
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/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
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/978-3-319-24953-7_30openalex-snapshot
Game Semantic Analysis of Equivalence in IMJ
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_16openalex-snapshot
Angelic Semantics of Fine-Grained Concurrency
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_21openalex-snapshot
A Game Semantics of Local Names and Good Variables
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_29openalex-snapshot
Java JR: Fully Abstract Trace Semantics for a Core Java Language
inferredcites →https://doi.org/10.1007/978-3-540-45220-1_48openalex-snapshot
Logical Relations for Dynamic Name Creation
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_4openalex-snapshot
Full Abstraction for Reduced ML
inferredcites →https://doi.org/10.1007/978-3-642-31585-5_30openalex-snapshot
Algorithmic Games for Full Ground References
inferredcites →https://doi.org/10.1007/978-3-662-46678-0_17openalex-snapshot
Operational Nominal Game Semantics
inferredcites →https://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferredcites →https://doi.org/10.1016/0022-4049(93)90035-ropenalex-snapshot
Introduction to extensive and distributive categories
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(93)90095-bopenalex-snapshot
A type-theoretical alternative to ISWIM, CUCH, OWHY
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.apal.2007.10.006openalex-snapshot
A game semantics of names and pointers
inferredcites →https://doi.org/10.1016/j.entcs.2012.08.013openalex-snapshot
A System-Level Game Semantics
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.012openalex-snapshot
A fully abstract may testing semantics for concurrent objects
inferredcites →https://doi.org/10.1016/s0304-3975(00)00194-8openalex-snapshot
Finitary PCF is not decidable
inferredcites →https://doi.org/10.1016/s0304-3975(01)00024-xopenalex-snapshot
Combining a monad and a comonad
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.1016/s0304-3975(99)00047-xopenalex-snapshot
Full abstraction for Idealized Algol with passive expressions
inferredcites →https://doi.org/10.1016/s0890-5401(03)00138-xopenalex-snapshot
Nominal logic, a first order theory of names and binding
inferredcites →https://doi.org/10.1016/s1571-0661(05)80056-8openalex-snapshot
Models for the computational λ-calculus
inferredcites →https://doi.org/10.1017/cbo9780511626364openalex-snapshot
Theories of Programming Languages
inferredcites →https://doi.org/10.1017/s0960129597002375openalex-snapshot
Premonoidal categories and notions of computation
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.1990.113772openalex-snapshot
Recursive types reduced to inductive types
inferredcites →https://doi.org/10.1109/lics.1996.561316openalex-snapshot
Games and full abstraction for FPC
inferredcites →https://doi.org/10.1109/lics.1997.614931openalex-snapshot
Full abstraction for functional languages with control
inferredcites →https://doi.org/10.1109/lics.1997.614933openalex-snapshot
Believe it or not, AJM's games model is a model of classical linear logic
inferredcites →https://doi.org/10.1109/lics.1997.614935openalex-snapshot
Games and definability for system F
inferredcites →https://doi.org/10.1109/lics.1998.705669openalex-snapshot
A fully abstract game semantics for general references
inferredcites →https://doi.org/10.1109/lics.1999.782617openalex-snapshot
A new approach to abstract syntax involving binders
inferredcites →https://doi.org/10.1109/lics.1999.782637openalex-snapshot
A fully abstract game semantics for finite nondeterminism
inferredcites →https://doi.org/10.1109/lics.2001.932487openalex-snapshot
A fully abstract game semantics of local exceptions
inferredcites →https://doi.org/10.1109/lics.2003.1210050openalex-snapshot
On program equivalence in languages with ground-type references
inferredcites →https://doi.org/10.1109/lics.2004.27openalex-snapshot
Nominal games and full abstraction for the nu-calculus
inferredcites →https://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/1218563.1218579openalex-snapshot
Fully abstract semantics of additive aspects by translation
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/2933575.2934509openalex-snapshot
Trace semantics for polymorphic references
inferredcites →https://doi.org/10.21236/ada266522openalex-snapshot
Monads and Comonads in Intensional Semantics
inferredcites →https://doi.org/10.2307/2275407openalex-snapshot
Games and full completeness for multiplicative linear logic
inferredcites →https://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
inferredcites →https://doi.org/10.5860/choice.30-5049openalex-snapshot
Semantics of programming languages: structures and techniques
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_10openalex-snapshot
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_33openalex-snapshot
Equational Reasoning Modulo Commutativity in Languages with Binders
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-642-00596-1_4openalex-snapshot
Full Abstraction for Reduced ML
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_25openalex-snapshot
Freshness and Name-Restriction in Sets of Traces with Names
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_28openalex-snapshot
Generalised Name Abstraction for Nominal Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_11openalex-snapshot
Game Semantics for Nominal Exceptions
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_23openalex-snapshot
A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus
inferred← citeshttps://doi.org/10.1007/s10703-017-0292-9openalex-snapshot
Algorithmic games for full ground references
inferred← citeshttps://doi.org/10.1016/j.apal.2013.05.007openalex-snapshot
Full abstraction for Reduced ML
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100894openalex-snapshot
Operationally-based program equivalence proofs using LCTRSs
inferred← citeshttps://doi.org/10.1109/lics.2017.8005109openalex-snapshot
A monad for full ground reference cells
inferred← citeshttps://doi.org/10.1145/2429069.2429073openalex-snapshot
Full abstraction for nominal Scott domains
inferred← citeshttps://doi.org/10.1145/2629529openalex-snapshot
Denotational Semantics with Nominal Scott Domains
inferred← citeshttps://doi.org/10.1145/2948896.2948902openalex-snapshot
An invitation to game semantics
inferred← citeshttps://doi.org/10.1145/3428676openalex-snapshot
Game Semantics for Interface Middleweight Java
inferred← citeshttps://doi.org/10.1145/3498686openalex-snapshot
Verified compilation of C programs with a nominal memory model
inferred← citeshttps://doi.org/10.23638/dmtcs-19-1-17openalex-snapshot
A class of symmetric difference-closed sets related to commuting involutions
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.