Strictness analysis and polymorphic invariance
 Abramsky, S Lecture Notes in Computer Science volume 217 1-23 (29 May 1986)
Mixed computation of Prolog programs
 Fuller, D Abramsky, S New Generation Computing volume 6 issue 2-3 119-141 (Sep 1988)
Observation equivalence as a testing equivalence
 Abramsky, S Theoretical Computer Science volume 53 issue 2-3 225-241 (1987)
An Integrated Engineering Study Scheme in Computing
 Finkelstein, A Kramer, J Abramsky, S Broda, K Drossopoulou, S Eisenbach, S The Computer Journal volume 36 issue 4 320-334 (01 Apr 1993)
New Foundations for the Geometry of Interaction
 Abramsky, S Jagadeesan, R Information and Computation volume 111 issue 1 53-119 (May 1994)
Call-by-value games
 Abramsky, S McCusker, G Lecture Notes in Computer Science volume 1414 1-17 (15 Jun 1998)
Domain theory in logical form*
 Abramsky, S Annals of Pure and Applied Logic volume 51 issue 1-2 1-77 (Mar 1991)
Computational interpretations of linear logic
 Abramsky, S Theoretical Computer Science volume 111 issue 1-2 3-57 (Apr 1993)
Proofs as processes
 Abramsky, S Theoretical Computer Science volume 135 issue 1 5-9 (Dec 1994)
Subscribe to