Samson Abramsky
Samson Abramsky
Professor of Computer Science, Oxford University
Email verificata su cs.ox.ac.uk - Home page
TitoloCitata daAnno
Domain theory
S Abramsky, A Jung
Oxford University Press, 1994
15511994
A categorical semantics of quantum protocols
S Abramsky, B Coecke
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
7442004
Computational Interpretations of Linear logic
S Abramsky
Theoretical Computer Science 111, 3--57, 1993
6931993
The Lazy Lambda Calculus
S Abramsky
Research Topics in Functional Programming, 65--116, 1990
6411990
Domain Theory in Logical Form
S Abramsky
Annals of Pure and Applied Logic 51, 1–77, 1991
6151991
Full Abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Information and Computation 163 (2), 409--470, 2000
551*2000
Games and full completeness for multiplicative linear logic
S Abramsky, R Jagadeesan
The Journal of Symbolic Logic 59 (2), 543-574, 1994
4551994
Abstract interpretation of declarative languages
S Abramsky, C Hankin
Halsted Press, 1987
4191987
Handbook of logic in computer science
S Abramsky, D Gabbay, T Maibaurn
392*1992
Full Abstraction in the Lazy Lambda Calculus
S Abramsky, L Ong
Information and Computation 105 (2), 159--268, 1993
3191993
The sheaf-theoretic structure of non-locality and contextuality
S Abramsky, A Brandenburger
New J. Phys. 13 (113036), 1--40, 2011
3092011
Observation equivalence as a testing equivalence
S Abramsky
Theoretical Computer Science 53 (2-3), 225-241, 1987
2991987
Domain theory, Handbook of logic in computer science (vol. 3): semantic structures
S Abramsky, A Jung
Oxford University Press, Oxford, 1995
2841995
Quantales, Observational Logic and Process Semantics
S Abramsky
2791993
Strictness Analysis for Higher Order Functions
S Abramsky, G Burn, C Hankin
Science of Computer Programming 7, 249– 278, 1986
254*1986
Semantics of interaction: an introduction to game semantics
S Abramsky
Semantics and Logics of Computation, Publications of the Newton Institute, 1-31, 1997
2481997
A Domain Equation for Bisimulation
S Abramsky
Information and Computation 92 (2), 161-218, 1991
2411991
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
2281998
Full abstraction for PCF
S Abramsky, R Jagadeesan, P Malacaria
Theoretical Aspects of Computer Software, 1--15, 1994
2271994
Concurrent games and full completeness
S Abramsky, PA Mellies
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
2211999
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20