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)
A specification structure for deadlock-freedom of synchronous processes
 Abramsky, S Gay, S Nagarajan, R Theoretical Computer Science volume 222 issue 1-2 1-53 (Jul 1999)
Full abstraction for Idealized Algol with passive expressions
 Abramsky, S McCusker, G Theoretical Computer Science volume 227 issue 1-2 3-42 (Sep 1999)
Experiments, powerdomains and fully abstract models for applicative multiprogramming
 Abramsky, S Lecture Notes in Computer Science volume 158 1-13 (31 May 1983)
Strictness analysis for higher-order functions
 Burn, G Hankin, C Abramsky, S Science of Computer Programming volume 7 249-278 (1986)
A domain equation for bisimulation
 Abramsky, S Information and Computation volume 92 issue 2 161-218 (Jun 1991)
Games and full Completeness for multiplicative Linear Logic
 Abramsky, S Jagadeesan, R Lecture Notes in Computer Science volume 652 291-301 (01 Jun 1992)
Full Abstraction in the Lazy Lambda Calculus
 Abramsky, S Ong, C Information and Computation volume 105 issue 2 159-267 (Aug 1993)
Subscribe to