Reader / Director of Postgraduate Studies (PhD)

1 West 4.64

Dept of Computer Science

Email: j.d.laird@bath.ac.uk

Tel: +44 (0) 1225 38 4438

# Dr James Laird

## Profile

### Research interests

Research interests lie in and around denotational semantics: the interpretation of computer programs and logical proofs as mathematical objects, such as strategies for a game, functions between domains or morphisms in a category. Jim aims to use these representations to describe, constrain and reason about particular computational effects and control and data flow generally.

### Publications

Gowers, W. J. and Laird, J., 2017. Sequoidal Categories and Transfinite Games:A Coalgebraic Approach to Stateful Objects in Game Semantics. *In*: Bonchi, F. and König, B., eds. *7th Conference on Algebra and Coalgebra in Computer Science*, 2017-06-12 - 2017-06-16, Faculty of Mathematics and Physics, University of Ljubljana. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.

Laird, J., 2017. From Qualitative to Quantitative Semantics by Change of Base. *In*: *20th International Conference on Foundations of Software Science and Computation Structures*, 2017-04-24 - 2017-04-27.

Laird, J., 2017. Combining Control Effects and Their Models:Game Semantics for a hierarchy of static, dynamic and delimited control effects. *Annals of Pure and Applied Logic*, 168 (2), pp. 470-500.

Laird, J., 2016. Polymorphic Game Semantics for Dynamic Binding.

Laird, J., 2016. Fixed points in quantitative semantics. *In*: Shankar, N., ed. *31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016*, 2016-07-05 - 2016-07-08. New York, U. S. A.: ACM, pp. 347-356.

Laird, J., 2016. Weighted relational models for mobility. *In*: *1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016*, 2016-06-22 - 2016-06-26. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.

Laird, J., 2016. Game semantics for bounded polymorphism. *In*: Jacobs, B. and Loding, C., eds. *19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016 and Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016*, 2016-04-02 - 2016-04-08. The Netherlands: Springer Verlag, pp. 55-70.

Laird, J., 2015. Sequential algorithms for unbounded nondeterminism. *Electronic Notes in Theoretical Computer Science*, 319, pp. 271-287.

Churchill, M., Laird, J. and McCusker, G., 2013. Imperative programs as proofs via game semantics. *Annals of Pure and Applied Logic*, 164 (11), pp. 1038-1078.

Laird, J., 2013. Combining and relating control effects and their semantics. *EPTCS*

Laird, J., 2013. Game semantics for a polymorphic programming language. *Journal of the ACM*, 60 (4), 29.

Laird, J. D., Manzonetto, G., Mccusker, G. and Pagani, M., 2013. Weighted relational models of typed Lambda-Calculi. *In*: *2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013)*, 2013-06-25 - 2013-06-28. Los Alamitos, California: IEEE, pp. 301-310.

Laird, J., Manzonetto, G. and McCusker, G., 2013. Constructing differential categories and deconstructing categories of games. *Information and Computation*, 222, pp. 247-264.

Laird, J., 2013. Combining and Relating Control Operators and their Semantics. *In*: *Control Operators and their Semantics.Vol. 127.* Elsevier, pp. 113-129.

Laird, J., Manzonetto, G. and McCusker, G., 2011. Constructing differential categories and deconstructing categories of games. *In*: Aceto, L., Henzinger, M. and Sgall, J., eds. *Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings.* Heidelberg, Germany: Springer, pp. 186-197.

Churchill, M., Laird, J. and McCusker, G., 2011. Imperative programs as proofs via game semantics. IEEE, pp. 65-74.

Churchill, M. and Laird, J., 2010. A logic of sequentiality. *In*: Dawar, A. and Veith, H., eds. *Computer Science Logic (Lecture Notes in Computer Science).Vol. 6247/2.* Springer, pp. 215-229.

Laird, J., 2010. Game semantics for call-by-value polymorphism. *Lecture Notes in Computer Science*, 6199 LNCS, pp. 187-198.

Laird, J., 2010. Game semantics for a polymorphic programming language. *In*: *25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010*, 2010-07-01. IEEE, pp. 41-49.

Laird, J., 2009. Nondeterminism and observable sequentiality. Berlin: Springer, pp. 379-393.

Laird, J., 2008. Decidability and syntactic control of interference. *Theoretical Computer Science*, 394 (1-2), pp. 64-83.

Laird, J., 2008. A game semantics of names and pointers. *Annals of Pure and Applied Logic*, 151 (2-3), pp. 151-169.