Samson Abramsky

Prof. Dr. Samson Abramsky

Department of Computer Science, University College London, Gower Street, London WC1E 6BT, UK
orcid

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2011 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
Samson AbramskySamson Abramsky
Samson Abramsky
ABAdam Brandenburger
Adam Brandenburger

1 January 2004
Verified
Conference Paper
Closed access
Samson AbramskySamson Abramsky
Samson Abramsky
BCB. Coecke
B. Coecke
Particular focus in this paper is on quantum information protocols, which exploit quantum-mechanical effects in an essential way. The particular examples we shall use to illustrate our approach will be teleportation (Benett et al., 1993), logic-gate teleportation (Gottesman and Chuang,1999), and entanglement swapping (Zukowski et al., 1993). The ideas illustrated in these protocols form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation (2001,1999,2000).

1 December 2000 in Information and Computation
Verified
Journal Article
Closed access
Samson AbramskySamson Abramsky
Samson Abramsky
RJRadha Jagadeesan
Radha Jagadeesan
PMPasquale Malacaria
Pasquale Malacaria

1 March 1991 in Annals of Pure and Applied Logic
Verified
Journal Article
Closed access
Samson AbramskySamson Abramsky
Samson Abramsky

1 April 1993 in Theoretical Computer Science
Verified
Journal Article
Closed access
Samson AbramskySamson Abramsky
Samson Abramsky

1 June 1994 in The Journal of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
Samson AbramskySamson Abramsky
Samson Abramsky
RJRadha Jagadeesan
Radha Jagadeesan
We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass, et al.