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) doi:10.1016/s0304-3975(98)00189-3
Full abstraction for Idealized Algol with passive expressions
 Abramsky, S McCusker, G Theoretical Computer Science volume 227 issue 1-2 3-42 (Sep 1999) doi:10.1016/s0304-3975(99)00047-x
Experiments, powerdomains and fully abstract models for applicative multiprogramming
 Abramsky, S Lecture Notes in Computer Science volume 158 1-13 (31 May 1983) doi:10.1007/3-540-12689-9_89
Strictness analysis for higher-order functions
 Burn, G Hankin, C Abramsky, S Science of Computer Programming volume 7 249-278 (1986) doi:10.1016/0167-6423(86)90010-9
A domain equation for bisimulation
 Abramsky, S Information and Computation volume 92 issue 2 161-218 (Jun 1991) doi:10.1006/inco.1991.9999
Games and full Completeness for multiplicative Linear Logic
 Abramsky, S Jagadeesan, R Lecture Notes in Computer Science volume 652 291-301 (01 Jun 1992) doi:10.1007/3-540-56287-7_113
Full Abstraction in the Lazy Lambda Calculus
 Abramsky, S Ong, C Information and Computation volume 105 issue 2 159-267 (Aug 1993) doi:10.1006/inco.1993.1044
Subscribe to