| Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions S Abramsky, G McCusker Electronic Notes in Theoretical Computer Science 3, 2-14, 1996 | 296 | 1996 |
| A fully abstract game semantics for general references S Abramsky, K Honda, G McCusker Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 291 | 1998 |
| Game semantics S Abramsky, G McCusker Computational Logic: Proceedings of the NATO Advanced Study Institute on …, 1999 | 230 | 1999 |
| Call-by-value games S Abramsky, G McCusker International Workshop on Computer Science Logic, 1-17, 1997 | 187 | 1997 |
| Games and full abstraction for a functional metalanguage with recursive types G McCusker Springer Science & Business Media, 1998 | 164 | 1998 |
| Weighted relational models of typed lambda-calculi J Laird, G Manzonetto, G McCusker, M Pagani 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), 301-310, 2013 | 154 | 2013 |
| A fully abstract game semantics for finite nondeterminism R Harmer, G McCusker Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 144 | 1999 |
| Games and full abstraction for FPC G McCusker Information and Computation 160 (1-2), 1-61, 2000 | 100 | 2000 |
| Reasoning about Idealized Algol using regular languages DR Ghica, G McCusker International Colloquium on Automata, Languages, and Programming, 103-115, 2000 | 93 | 2000 |
| Full abstraction for Idealized Algol with passive expressions S Abramsky, G McCusker Theoretical Computer Science 227 (1-2), 3-42, 1999 | 82 | 1999 |
| The regular-language semantics of second-order idealized Algol DR Ghica, G McCusker Theoretical Computer Science 309 (1-3), 469-502, 2003 | 75 | 2003 |
| Games and full abstraction for the lazy/spl lambda/-calculus S Abramsky, G McCusker Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 234-243, 1995 | 47 | 1995 |
| Games for Recursive Types. S Abramsky, G McCusker Theory and Formal Methods, 1-20, 1994 | 35 | 1994 |
| Constructing differential categories and deconstructing categories of games J Laird, G Manzonetto, G McCusker Information and Computation 222, 247-264, 2013 | 29 | 2013 |
| Coalgebraic semantics for parallel derivation strategies in logic programming E Komendantskaya, G McCusker, J Power International Conference on Algebraic Methodology and Software Technology …, 2010 | 26 | 2010 |
| A fully abstract relational model of syntactic control of interference G McCusker International Workshop on Computer Science Logic, 247-261, 2002 | 24 | 2002 |
| Understanding game semantics through coherence spaces AC Calderon, G McCusker Electronic Notes in Theoretical Computer Science 265, 231-244, 2010 | 22 | 2010 |
| Games for recursive types, BCS Distinguished Dissertation G McCusker Cambridge University Press, 1998 | 19 | 1998 |
| Games and definability for FPC GUY McCUSKER Bulletin of Symbolic Logic 3 (3), 347-362, 1997 | 17 | 1997 |
| On the semantics of the bad-variable constructor in Algol-like languages G McCusker Electronic Notes in Theoretical Computer Science 83, 169-186, 2003 | 14 | 2003 |
Samson AbramskyProfessor of Computer Science, UCLVerified email at ucl.ac.uk
