| Full abstraction for functional languages with control J Laird Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 58-67, 1997 | 184 | 1997 |
| Weighted relational models of typed lambda-calculi J Laird, G Manzonetto, G McCusker, M Pagani 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 301-310, 2013 | 154 | 2013 |
| A fully abstract trace semantics for general references J Laird International Colloquium on Automata, Languages, and Programming, 667-679, 2007 | 94 | 2007 |
| A semantic analysis of control JD Laird University of Edinburgh. College of Science and Engineering. School of …, 1999 | 70 | 1999 |
| A fully abstract game semantics of local exceptions J Laird Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 105-114, 2001 | 66 | 2001 |
| A Game Semantics of the Asynchronous π-Calculus J Laird International Conference on Concurrency Theory, 51-65, 2005 | 41 | 2005 |
| A game semantics of local names and good variables J Laird International Conference on Foundations of Software Science and Computation …, 2004 | 41 | 2004 |
| A game semantics of idealized CSP J Laird Electronic Notes in Theoretical Computer Science 45, 232-257, 2001 | 41 | 2001 |
| Game semantics for higher-order concurrency J Laird International Conference on Foundations of Software Technology and …, 2006 | 38 | 2006 |
| A categorical semantics of higher order store J Laird Electronic notes in Theoretical Computer Science 69, 209-226, 2003 | 38 | 2003 |
| A game semantics of names and pointers J Laird Annals of Pure and Applied Logic 151 (2-3), 151-169, 2008 | 33 | 2008 |
| Constructing differential categories and deconstructing categories of games J Laird, G Manzonetto, G McCusker Information and Computation 222, 247-264, 2013 | 29 | 2013 |
| Locally boolean domains J Laird Theoretical Computer Science 342 (1), 132-148, 2005 | 26 | 2005 |
| Game semantics for a polymorphic programming language J Laird Journal of the ACM (JACM) 60 (4), 1-27, 2013 | 24 | 2013 |
| Exceptions, continuations and macro-expressiveness J Laird European Symposium on Programming, 133-146, 2002 | 24 | 2002 |
| Game semantics and linear CPS interpretation J Laird Theoretical computer science 333 (1-2), 199-224, 2005 | 20 | 2005 |
| A game semantics of linearly used continuations J Laird International Conference on Foundations of Software Science and Computation …, 2003 | 20 | 2003 |
| Bistability: an extensional characterization of sequentiality J Laird International Workshop on Computer Science Logic, 372-383, 2003 | 18 | 2003 |
| Bidomains and full abstraction for countable nondeterminism J Laird International Conference on Foundations of Software Science and Computation …, 2006 | 17 | 2006 |
| A fully abstract bidomain model of unary FPC J Laird International Conference on Typed Lambda Calculi and Applications, 211-225, 2003 | 17 | 2003 |
