421 citations · 1.5k across the 77 of their papers we have counts for
5 papers · 1 filter
Process Realizability
Samson Abramsky
We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.
DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics
Samson Abramsky, Dominic Horsman
Maxwell's Demon, 'a being whose faculties are so sharpened that he can follow every molecule in its course', has been the centre of much debate about its abilities to violate the s…
Games for Dependent Types
Samson Abramsky, Radha Jagadeesan, Matthijs Vákár
We present a model of dependent type theory (DTT) with Pi-, 1-, Sigma- and intensional Id-types, which is based on a slight variation of the category of AJM-games and history-free…
Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states
Samson Abramsky, Carmen M. Constantin, Shenggang Ying
We show that all -qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, admit Hardy-type proofs of non-locality…
Contextuality, Cohomology and Paradox
Samson Abramsky, Rui Soares Barbosa, Kohei Kishida +2
Contextuality is a key feature of quantum mechanics that provides an important non-classical resource for quantum information and computation. Abramsky and Brandenburger used sheaf…