Projects per year
Personal 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.
Fingerprint
- 1 Similar Profiles
Projects
- 6 Finished
-
Games and Differential Nets for Concurrent Systems
Laird, J. (PI), Guglielmi, A. (CoI), McCusker, G. (CoI) & Power, J. (CoI)
1/08/15 → 30/11/17
Project: Research council
-
Semantic Types for Verified Program Behaviour
Laird, J. (PI)
Engineering and Physical Sciences Research Council
28/02/14 → 31/07/17
Project: Research council
-
Sharing and Sequentiality in Proof Systems with Locality
Guglielmi, A. (PI), Bruscoli, P. (CoI), Laird, J. (CoI), McCusker, G. (CoI) & Power, J. (CoI)
29/03/12 → 30/06/14
Project: Research council
-
Graph Models of Functional, Imperative and Logic Programming
McCusker, G. (PI), Guglielmi, A. (CoI), Laird, J. (CoI) & Power, J. (CoI)
20/01/11 → 31/01/14
Project: Research council
-
Semantic Structures for Higher-Order Information Flow
Laird, J. (PI)
Engineering and Physical Sciences Research Council
20/06/10 → 19/06/12
Project: Research council
Research output
-
An Axiomatic Account of a Fully Abstract Game Semantics for General References
Laird, J. & McCusker, G., 2 Aug 2023, Samson Abramsky on Logic and Structure in Computer Science and Beyond. Palmigiano, A. & Sadrzadeh, M. (eds.). Cham, Switzerland: Springer, Cham, p. 251-292 42 p. (Outstanding Contributions to Logic; vol. 25).Research output: Chapter or section in a book/report/conference proceeding › Chapter or section
-
Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism
Laird, J., 28 Jun 2023, 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023. Gaboardi, M. & van Raamsdonk, F. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 260).Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding
Open Access -
Revisiting Decidable Bounded Quantification, via Dinaturality
Laird, J., 22 Feb 2023, In: Electronic Notes in Theoretical Informatics and Computer Science. 16 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile31 Downloads (Pure) -
A Compositional Cost Model for the λ-calculus
Laird, J., 29 Jun 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021. IEEE, Vol. 2021-June. p. 1-13 9470567. (Proceedings - Symposium on Logic in Computer Science; vol. 2021-June).Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding
Open AccessFile1 Citation (SciVal)165 Downloads (Pure) -
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism
Laird, J., 24 Nov 2021, In: Logical Methods in Computer Science. 17, 4, p. 11:1-11:37Research output: Contribution to journal › Article › peer-review
Open AccessFile45 Downloads (Pure)