Process Realizability (Abstract)
Abramsky, S
Electronic Notes in Theoretical Computer Science
volume 23
issue 1
1-2
(1999)
doi:10.1016/s1571-0661(04)00099-4
On semantic foundations for applicative multiprogramming
Abramsky, S
Lecture Notes in Computer Science
volume 154
1-14
(26 Dec 1983)
doi:10.1007/bfb0036893
Specification Structures and propositions-as-types for concurrency
Abramsky, S
Gay, S
Nagarajan, R
Lecture Notes in Computer Science
volume 1043
5-40
(02 Jun 1996)
doi:10.1007/3-540-60915-6_2
A fully abstract game semantics for general references
Abramsky, S
Honda, K
McCusker, G
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
334-344
(01 Jan 1998)
doi:10.1109/lics.1998.705669
Strictness analysis and polymorphic invariance
Abramsky, S
1-23
(29 May 1986)
doi:10.1007/3-540-16446-4_1
Quantales, observational logic and process semantics
Abramsky, S
Vickers, S
Mathematical Structures in Computer Science
volume 3
issue 2
161-227
(04 Jun 1993)
doi:10.1017/s0960129500000189
The theory of strictness analysis for higher order functions
Burn, G
Hankin, C
Abramsky, S
Lecture Notes in Computer Science
volume 217
42-62
(29 May 1986)
doi:10.1007/3-540-16446-4_3