On the public citation graph

Full abstraction for the quantum lambda-calculus

0 signed · 68 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.2000.2917openalex-snapshot

On Full Abstraction for PCF: I, II, and III

inferredcites →https://doi.org/10.1006/inco.2000.2930openalex-snapshot

Full Abstraction for PCF

inferredcites →https://doi.org/10.1007/978-3-540-87531-4_18openalex-snapshot

Quantitative Game Semantics for Linear Logic

inferredcites →https://doi.org/10.1007/978-3-642-02273-9_7openalex-snapshot

Thick Subtrees, Games and Experiments

inferredcites →https://doi.org/10.1007/978-3-642-38164-5_13openalex-snapshot

Presheaf Models of Quantum Computation: An Outline

inferredcites →https://doi.org/10.1007/bfb0028007openalex-snapshot

Timeless games

inferredcites →https://doi.org/10.1016/0022-4049(95)00160-3openalex-snapshot

Weakly distributive categories

inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot

Fully abstract models of typed λ-calculi

inferredcites →https://doi.org/10.1016/j.apal.2009.07.018openalex-snapshot

Resource modalities in tensor logic

inferredcites →https://doi.org/10.1016/j.apal.2016.10.010openalex-snapshot

Semantics of higher-order quantum computation via geometry of interaction

inferredcites →https://doi.org/10.1016/j.entcs.2006.12.018openalex-snapshot

Dagger Compact Closed Categories and Completely Positive Maps

inferredcites →https://doi.org/10.1016/j.entcs.2007.02.022openalex-snapshot

Event Structures with Symmetry

inferredcites →https://doi.org/10.1016/j.entcs.2008.04.022openalex-snapshot

On a Fully Abstract Model for a Quantum Linear Functional Language

inferredcites →https://doi.org/10.1016/j.entcs.2010.08.014openalex-snapshot

Understanding Game Semantics Through Coherence Spaces

inferredcites →https://doi.org/10.1016/j.entcs.2011.01.005openalex-snapshot

Game Semantics for Quantum Data

inferredcites →https://doi.org/10.1016/j.ic.2012.10.015openalex-snapshot

Constructing differential categories and deconstructing categories of games

inferredcites →https://doi.org/10.1016/j.tcs.2006.01.016openalex-snapshot

Asynchronous games 2: The true concurrency of innocence

inferredcites →https://doi.org/10.1016/j.tcs.2010.02.020openalex-snapshot

Dcpo-completion of posets

inferredcites →https://doi.org/10.1016/j.tcs.2011.11.027openalex-snapshot

The Scott model of linear logic is the extensional collapse of its relational model

inferredcites →https://doi.org/10.1016/s0304-3975(01)00241-9openalex-snapshot

Glueing and orthogonality for models of linear logic

inferredcites →https://doi.org/10.1016/s0304-3975(01)00244-4openalex-snapshot

Exhausting strategies, joker games and full completeness for IMLL with Unit

inferredcites →https://doi.org/10.1016/s1571-0661(05)80312-3openalex-snapshot

Abstract Games for Linear Logic Extended Abstract

inferredcites →https://doi.org/10.1016/s1571-0661(05)80398-6openalex-snapshot

Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions

inferredcites →https://doi.org/10.1017/s0305004100074338openalex-snapshot

Traced monoidal categories

inferredcites →https://doi.org/10.1017/s0960129504004256openalex-snapshot

Towards a quantum programming language

inferredcites →https://doi.org/10.1017/s0960129506005238openalex-snapshot

A lambda calculus for quantum computation with classical control

inferredcites →https://doi.org/10.1017/s0960129597002375openalex-snapshot

Premonoidal categories and notions of computation

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.1999.782638openalex-snapshot

Concurrent games and full completeness

inferredcites →https://doi.org/10.1109/lics.2005.6openalex-snapshot

Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic

inferredcites →https://doi.org/10.1109/lics.2011.13openalex-snapshot

Concurrent Strategies

inferredcites →https://doi.org/10.1109/lics.2012.34openalex-snapshot

The Winning Ways of Concurrent Games

inferredcites →https://doi.org/10.1109/lics.2015.30openalex-snapshot

Nondeterminism in Game Semantics via Sheaves

inferredcites →https://doi.org/10.1109/lics.2015.31openalex-snapshot

The Parallel Intensionally Fully Abstract Games Model of PCF

inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot

A fast quantum mechanical algorithm for database search

inferredcites →https://doi.org/10.1145/2535838.2535865openalex-snapshot

Probabilistic coherence spaces are fully abstract for probabilistic PCF

inferredcites →https://doi.org/10.1145/2535838.2535879openalex-snapshot

Applying quantitative semantics to higher-order quantum computing

inferredcites →https://doi.org/10.1145/2603088.2603141openalex-snapshot

Symmetry in concurrent games

inferredcites →https://doi.org/10.1145/3209108.3209187openalex-snapshot

The concurrent game semantics of Probabilistic PCF

inferredcites →https://doi.org/10.1145/3290340openalex-snapshot

Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous side

inferredcites →https://doi.org/10.1145/3290345openalex-snapshot

Game semantics for quantum programming

inferredcites →https://doi.org/10.23638/lmcs-13(3:35)2017openalex-snapshot

Games and Strategies as Event Structures

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-72019-3_19openalex-snapshot

Bayesian strategies: probabilistic programs as generalised graphical models

inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_10openalex-snapshot

A Tale of Additives and Concurrency in Game Semantics

inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_8openalex-snapshot

Combining quantum and classical control: syntax, semantics and adequacy

inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_8openalex-snapshot

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases

inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100790openalex-snapshot

Semantics of quantum programming languages: Classical control, quantum control

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175681openalex-snapshot

From Thin Concurrent Games to Generalized Species of Structures

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175754openalex-snapshot

The Cartesian Closed Bicategory of Thin Spans of Groupoids

inferred← citeshttps://doi.org/10.1109/lics65433.2025.00045openalex-snapshot

The Qualitative Collapse of Concurrent Games

inferred← citeshttps://doi.org/10.1109/lics65433.2025.00071openalex-snapshot

Operator Spaces, Linear Logic and the Heisenberg-Schrödinger Duality of Quantum Theory

inferred← citeshttps://doi.org/10.1145/3498687openalex-snapshot

Semantics for variational Quantum programming

inferred← citeshttps://doi.org/10.1145/3498691openalex-snapshot

Twist: sound reasoning for purity and entanglement in Quantum programs

inferred← citeshttps://doi.org/10.1145/3498705openalex-snapshot

Fully abstract models for effectful λ-calculi via category-theoretic logical relations

inferred← citeshttps://doi.org/10.1145/3571217openalex-snapshot

The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding

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/3632855openalex-snapshot

Enriched Presheaf Model of Quantum FPC

inferred← citeshttps://doi.org/10.1145/3649811openalex-snapshot

Quantum Control Machine: The Limits of Control Flow in Quantum Programming

inferred← citeshttps://doi.org/10.1145/3661814.3662075openalex-snapshot

Concurrent Games over Relational Structures: The Origin of Game Comonads

inferred← citeshttps://doi.org/10.1145/3734192.3734195openalex-snapshot

Distributed Strategies—Past and Future

inferred← citeshttps://doi.org/10.1145/3743149openalex-snapshot

Integration of Quantum Accelerators with High Performance Computing—A Review of Quantum Programming Tools

inferred← citeshttps://doi.org/10.4230/lipics.csl.2026.4openalex-snapshot

The Quantitative Collapse of Concurrent Games with Symmetry

inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.17openalex-snapshot

Positional Injectivity for Innocent Strategies

inferred← citeshttps://doi.org/10.46298/entics.10498openalex-snapshot

Bi-invariance for Uniform Strategies on Event Structures

inferred← citeshttps://doi.org/10.48550/arxiv.2304.15000openalex-snapshot

Quantum Control Machine: The Limits of Control Flow in Quantum Programming

inferred← citeshttps://doi.org/10.70675/1fe9d40fzc796z4fb8zbc8fz98a158e7d52aopenalex-snapshot

Quantum Game Semantics

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.