Event Domains, Stable Functions and Proof-Nets
Abramsky, S
Electronic Notes in Theoretical Computer Science
volume 172
33-67
(01 Apr 2007)
doi:10.1016/j.entcs.2007.02.003
A categorical quantum logic
Abramsky, S
Duncan, R
Mathematical Structures in Computer Science
volume 16
issue 3
469-489
(01 Jun 2006)
doi:10.1017/S0960129506005275
What are the Fundamental Structures of Concurrency?. We still don't know!
Abramsky, S
Electronic Notes in Theoretical Computer Science
volume 162
issue 1
37-41
(29 Sep 2006)
doi:10.1016/j.entcs.2005.12.075
Algorithmic game semantics and static analysis
Abramsky, S
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
volume 3672 LNCS
1
(01 Jan 2005)
doi:10.1007/11547662_1
A game semantics for generic polymorphism
Abramsky, S
Jagadeesan, R
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
volume 2620
1-22
(01 Jan 2003)
doi:10.1007/3-540-36576-1_1
A structural approach to reversible computation
Abramsky, S
Theoretical Computer Science
volume 347
issue 3
441-464
(01 Dec 2005)
doi:10.1016/j.tcs.2005.07.002
Abstract scalars, loops, and free traced and strongly compact closed categories
Abramsky, S
Lecture Notes in Computer Science
volume 3629
1-29
(01 Jan 2005)
doi:10.1007/11548133_1
Abstract physical traces
Abramsky, S
Coecke, B
Theory and Applications of Categories
volume 14
issue 6
(28 Nov 2005)
Game Theory Meets Theoretical Computer Science
Abramsky, S
Mavronicolas, M
Theoretical Computer Science
volume 343
issue 1-2
1-3
(10 Oct 2005)
doi:10.1016/j.tcs.2005.05.004
Linear realizability and full completeness for typed lambda-calculi
Abramsky, S
Lenisa, M
Annals of Pure and Applied Logic
volume 134
issue 2-3
122-168
(01 Jul 2005)
doi:10.1016/j.apal.2004.08.003