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
16041994
A categorical semantics of quantum protocols
S Abramsky, B Coecke
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
8242004
Computational Interpretations of Linear logic
S Abramsky
Theoretical Computer Science 111, 3--57, 1993
7091993
The Lazy Lambda Calculus
S Abramsky
Research Topics in Functional Programming, 65--116, 1990
6821990
Domain Theory in Logical Form
S Abramsky
Annals of Pure and Applied Logic 51, 1–77, 1991
6601991
Full Abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Information and Computation 163 (2), 409--470, 2000
6022000
Games and full completeness for multiplicative linear logic
S Abramsky, R Jagadeesan
The Journal of Symbolic Logic 59 (2), 543-574, 1994
4751994
Handbook of logic in computer science
S Abramsky, D Gabbay, T Maibaurn
453*1992
Abstract interpretation of declarative languages
S Abramsky, C Hankin
Prentice Hall Professional Technical Reference, 1987
4461987
The sheaf-theoretic structure of non-locality and contextuality
S Abramsky, A Brandenburger
New J. Phys. 13 (113036), 1--40, 2011
3992011
Stanford encyclopedia of philosophy
U Nodelman, C Allen, J Perry
Metaphysics Research Lab, Center for the Study of Language and Information …, 1995
3491995
Full Abstraction in the Lazy Lambda Calculus
S Abramsky, L Ong
Information and Computation 105 (2), 159--268, 1993
3321993
Observation equivalence as a testing equivalence
S Abramsky
Theoretical Computer Science 53 (2-3), 225-241, 1987
3091987
Quantales, Observational Logic and Process Semantics
S Abramsky
2911993
Strictness Analysis for Higher Order Functions
S Abramsky, G Burn, C Hankin
Science of Computer Programming 7, 249– 278, 1986
262*1986
Semantics of interaction: an introduction to game semantics
S Abramsky
Semantics and Logics of Computation, Publications of the Newton Institute, 1-31, 1997
2521997
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
2461998
A Domain Equation for Bisimulation
S Abramsky
Information and Computation 92 (2), 161-218, 1991
2431991
Concurrent games and full completeness
S Abramsky, PA Mellies
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
2421999
Full abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Theoretical Aspects of Computer Software, 1--15, 1994
2331994
The system can't perform the operation now. Try again later.
Articles 1–20