James Laird

Dr

  • 1 WEST 4.64

19972018
If you made any changes in Pure these will be visible here soon.

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 Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 3 Similar Profiles
Game Semantics Mathematics
Semantics Engineering & Materials Science
Game Mathematics
Denotational Semantics Mathematics
Computer programming languages Engineering & Materials Science
Model Mathematics
Lambda Calculus Mathematics
Calculus Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2008 2017

Semantic Types for Verified Program Behaviour

Laird, J.

28/02/1431/07/17

Project: Research council

Semantics
Computer programming languages
Object oriented programming
Model checking
Polymorphism

Sharing and Sequentiality in Proof Systems with Locality

Guglielmi, A., Bruscoli, P., Laird, J., McCusker, G. & Power, A.

29/03/1230/06/14

Project: Research council

Semantic Structures for Higher-Order Information Flow

Laird, J.

20/06/1019/06/12

Project: Research council

Semantics
Computer programming languages
Mathematical models

Research Output 1997 2018

A fully abstract game semantics for countable nondeterminism

Gowers, W. J. & Laird, J. D., 1 Aug 2018, Computer Science Logic 2018, CSL 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 119. 24

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access
Semantics

Extensional and intensional semantic universes: A denotational model of dependent types

Blot, V. & Laird, J., 9 Jul 2018, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. IEEE, Vol. Part F138033. p. 95-104 10 p. (Proceedings - Symposium on Logic in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access
File
Type Theory
Forms (concrete)
Concrete Structures
Semantics
Game
Open Access

From Qualitative to Quantitative Semantics by Change of Base

Laird, J., Apr 2017.

Research output: Contribution to conferencePaper

Open Access
File

Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics

Gowers, W. J. & Laird, J., 31 May 2017, Proceedings of 7th Conference on Algebra and Coalgebra in Computer Science. Bonchi, F. & König, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (LIPIcs).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
Game Semantics
Coalgebra
Game
Functor
Transformer

Thesis

Modular Normalisation of Classical Proofs

Author: Ralph, B., 3 Apr 2019

Supervisor: Laird, J. (Supervisor) & Guglielmi, A. (Supervisor)

Student thesis: Doctoral ThesisPhD

File