Games and full abstraction for the lazy /spl lambda/-calculus
Abramsky, S
McCusker, G
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
234-243
(01 Jan 1995)
Abstract Interpretation, Logical Relations, and Kan Extensions
ABRAMSKY, S
Journal of Logic and Computation
volume 1
issue 1
5-40
(01 Jul 1990)
Concurrent games and full completeness
Abramsky, S
Mellies, P
Proceedings - Symposium on Logic in Computer Science
431-442
(01 Jan 1999)
PASCAL-M IN OFFICE INFORMATION SYSTEMS.
Cook, S
Abramsky, S
233-241
(01 Dec 1982)
DOMAIN THEORY IN LOGICAL FORM.
Abramsky, S
47-53
(01 Jan 1987)
Secd-m: a virtual machine for applicative programming
Abramsky, S
Sykes, R
Lecture Notes in Computer Science
volume 201
81-98
(08 Jun 1985)
Preface
Abramsky, S
Theoretical Computer Science
volume 135
issue 1
3-4
(Dec 1994)
A type-theoretic approach to deadlock-freedom of asynchronous systems
Abramsky, S
Gay, S
Nagarajan, R
Lecture Notes in Computer Science
volume 1281
295-320
(09 Jun 1997)
Game semantics for programming languages
Abramsky, S
Lecture Notes in Computer Science
volume 1295
1-4
(17 Jun 1997)
Specifying interaction categories
Pavlović, D
Abramsky, S
Lecture Notes in Computer Science
volume 1290
147-158
(20 Jun 1997)