Search filters

List of works by Samson Abramsky

A Domain Equation for Bisimulation

A Fully Complete PER Model for ML Polymorphic Types

article by Samson Abramsky & Marina Lenisa published 2000 in Lecture Notes in Computer Science

A Game Semantics for Generic Polymorphism

A categorical quantum logic

A categorical semantics of quantum protocols

A classification of multipartite states by degree of non-locality

A complete characterization of all-versus-nothing arguments for stabilizer states

scientific article published in November 2017

A domain equation for bisimulation

A fully abstract denotational semantics for the calculus of higher-order communicating systems

A fully abstract game semantics for general references

A game semantics for generic polymorphism

A generalized Kahn Principle for abstract asynchronous networks

A relational approach to strictness analysis for higher-order polymorphic functions

A specification structure for deadlock-freedom of synchronous processes

A structural approach to reversible computation

A type-theoretic approach to deadlock-freedom of asynchronous systems

Abstract Interpretation, Logical Relations, and Kan Extensions

article

Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories

Algorithmic Game Semantics

article published in 2002

Algorithmic Game Semantics and Static Analysis

An Internal Language for Autonomous Categories

An Operational Interpretation of Negative Probabilities and No-Signalling Models

An internal language for autonomous categories

Applying Game Semantics to Compositional Software Modeling and Verification

article

Arrow’s Theorem by Arrow Theory

Axiomatizing Fully Complete Models for ML Polymorphic Types

article by Samson Abramsky & Marina Lenisa published 2000 in Lecture Notes in Computer Science

Big toy models

article published in 2011

Call-by-value games

Categorical Quantum Mechanics

scholarly article published 2009

Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting

Coalgebras, Chu Spaces, and Representations of Physical Systems

Coalgebras, Chu Spaces, and Representations of Physical Systems

Computational interpretations of linear logic

Concurrent games and full completeness

Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity

scholarly article published 24 November 2015

DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics

Domain theory in logical form*

article

Event Domains, Stable Functions and Proof-Nets

Events in context

Experiments, powerdomains and fully abstract models for applicative multiprogramming

Foreword

From CSP to Game Semantics

From IF to BI

From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference

From Lawvere to Brandenburger–Keisler: Interactive forms of diagonalization and self-reference

scholarly article by Samson Abramsky & Jonathan Zvesper published August 2015 in Journal of Computer and System Sciences

Full Abstraction for PCF

Full Abstraction for PCF (extended abstract)

Full Abstraction in the Lazy Lambda Calculus

Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract)

Full abstraction for Idealized Algol with passive expressions

Fully Complete Minimal PER Models for the Simply Typed λ-Calculus

Game Semantics for Access Control

Game Semantics: Achievements and Prospects

article published in 2000

Game Theory Meets Theoretical Computer Science

Game semantics for programming languages

scholarly article by Samson Abramsky published 1997 in Lecture Notes in Computer Science

Games and full Completeness for multiplicative Linear Logic

Games and full abstraction for the lazy λ-calculus

Games and full completeness for multiplicative linear logic

Games for Dependent Types

Games, Interaction and Computation

Geometry of Interaction and linear combinatory algebras

scholarly article by Samson Abramsky et al published October 2002 in Mathematical Structures in Computer Science

Heterotic Computing Examples with Optics, Bacteria, and Chemicals

article by Susan Stepney et al published 2012 in Lecture Notes in Computer Science

High-level methods for quantum computation and information

scholarly article published 2004

INFORMATION, PROCESSES AND GAMES

Intensionality, Definability and Computation

Interaction Categories

Interaction Categories and the Foundations of Typed Concurrent Programming

Linear realizability and full completeness for typed lambda-calculi

Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions

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

Logic and Geometry of Agents in Agent-Based Modeling

Logic and Geometry of Agents in Agent-Based Modeling

Logical Bell inequalities

article

Mixed computation of Prolog programs

New Foundations for the Geometry of Interaction

article published in 1994

New foundations for the geometry of interaction

No-Cloning in Categorical Quantum Mechanics

scholarly article

No-Signalling Is Equivalent To Free Choice of Measurements

Nominal games and full abstraction for the nu-calculus

Nuclear and trace ideals in tensored ∗-categories

Observation equivalence as a testing equivalence

article published in 1987

Observational logic and process semantics (abstract)

On semantic foundations for applicative multiprogramming

Petri Nets, Discrete Physics, and Distributed Quantum Computation

Petri Nets, Discrete Physics, and Distributed Quantum Computation

Physical Traces

Preface

Preface

Preface

Process Realizability

scientific article

Proofs as processes

article

Quantales, observational logic and process semantics

Relational Databases and Bell’s Theorem

Relational Hidden Variables and Non-Locality

Retracing some paths in process algebra

scholarly article by Samson Abramsky published 1996 in Lecture Notes in Computer Science

Robin Milner's Work on Concurrency

Secd-m: a virtual machine for applicative programming

Semantic Unification

Semantics of Interaction: an Introduction to Game Semantics

Semantics of interaction

Sequentiality vs. concurrency in games and logic

Specification Structures and propositions-as-types for concurrency

Specifying interaction categories

Strictness analysis and polymorphic invariance

Strictness analysis for higher-order functions

Temperley–Lieb Algebra

scholarly article published 19 September 2007

The Ackermann Award 2006

The Cohomology of Non-Locality and Contextuality

scientific article published in October 2012

The Logic and Topology of Non-locality and Contextuality

The foundations of computation, physics and mentality: the Turing legacy

scientific article published in July 2012

The sheaf-theoretic structure of non-locality and contextuality

The theory of strictness analysis for higher order functions

What are the Fundamental Structures of Concurrency?

𝐻*-algebras and nonunital Frobenius algebras: First steps in infinite-dimensional categorical quantum mechanics

scholarly article published 2012