Follow
Samson Abramsky
Samson Abramsky
Professor of Computer Science, UCL
Verified email at ucl.ac.uk - Homepage
Title
Cited by
Cited by
Year
Domain theory
S Abramsky, A Jung
Oxford University Press, 1994
17021994
A categorical semantics of quantum protocols
S Abramsky, B Coecke
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
9812004
Full Abstraction in the Lazy Lambda Calculus
S Abramsky, L Ong
Information and Computation 105 (2), 159--268, 1993
9541993
Computational Interpretations of Linear logic
S Abramsky
Theoretical Computer Science 111, 3--57, 1993
7531993
Domain Theory in Logical Form
S Abramsky
Annals of Pure and Applied Logic 51, 1–77, 1991
7161991
Full Abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Information and Computation 163 (2), 409--470, 2000
6682000
The sheaf-theoretic structure of non-locality and contextuality
S Abramsky, A Brandenburger
New J. Phys. 13 (113036), 1--40, 2011
5762011
Games and full completeness for multiplicative linear logic
S Abramsky, R Jagadeesan
The Journal of Symbolic Logic 59 (2), 543-574, 1994
5021994
Abstract interpretation of declarative languages
S Abramsky, C Hankin
Prentice Hall Professional Technical Reference, 1987
4501987
Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures
S Abramsky, DM Gabbay, TSE Maibaum
OUP Oxford, 2001
3892001
Quantales, Observational Logic and Process Semantics
S Abramsky
3221993
Observation equivalence as a testing equivalence
S Abramsky
Theoretical Computer Science 53 (2-3), 225-241, 1987
3191987
Categorical quantum mechanics
S Abramsky, B Coecke
Handbook of quantum logic and quantum structures: quantum logic, 261-324, 2008
3032008
A fully abstract game semantics for general references
S Abramsky, K Honda, G McCusker
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998
2841998
Semantics of interaction: an introduction to game semantics
S Abramsky
Semantics and Logics of Computation, Publications of the Newton Institute, 1-31, 1997
2681997
Strictness Analysis for Higher Order Functions
S Abramsky, G Burn, C Hankin
Science of Computer Programming 7, 249– 278, 1986
265*1986
Concurrent games and full completeness
S Abramsky, PA Mellies
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
2621999
A Domain Equation for Bisimulation
S Abramsky
Information and Computation 92 (2), 161-218, 1991
2501991
Full abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Theoretical Aspects of Computer Software, 1--15, 1994
2461994
Strictness analysis for higher-order functions
GL Burn, C Hankin, S Abramsky
Science of Computer Programming 7, 249-278, 1986
2261986
The system can't perform the operation now. Try again later.
Articles 1–20