James Laird

Dr

  • 1 WEST 4.64

19972020

Research output per year

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

Research Output

Filter
Article
2017
Open Access
1 Citation (Scopus)
2015

Sequential algorithms for unbounded nondeterminism

Laird, J., 21 Dec 2015, In : Electronic Notes in Theoretical Computer Science. 319, p. 271-287 17 p.

Research output: Contribution to journalArticle

Open Access
2 Citations (Scopus)
83 Downloads (Pure)
2013

Combining and relating control effects and their semantics

Laird, J., 5 Sep 2013, In : EPTCS.

Research output: Contribution to journalArticle

Constructing differential categories and deconstructing categories of games

Laird, J., Manzonetto, G. & McCusker, G., Jan 2013, In : Information and Computation. 222, p. 247-264 18 p.

Research output: Contribution to journalArticle

Open Access
File
12 Citations (Scopus)
131 Downloads (Pure)

Game semantics for a polymorphic programming language

Laird, J., Aug 2013, In : Journal of the ACM. 60, 4, 27 p., 29.

Research output: Contribution to journalArticle

Open Access
File
9 Citations (Scopus)
94 Downloads (Pure)

Imperative programs as proofs via game semantics

Churchill, M., Laird, J. & McCusker, G., Nov 2013, In : Annals of Pure and Applied Logic. 164, 11, p. 1038-1078 41 p.

Research output: Contribution to journalArticle

Open Access
File
1 Citation (Scopus)
124 Downloads (Pure)
2010

Game semantics for call-by-value polymorphism

Laird, J., Jul 2010, In : Lecture Notes in Computer Science. 6199 LNCS, p. 187-198 12 p.

Research output: Contribution to journalArticle

4 Citations (Scopus)
2008

A game semantics of names and pointers

Laird, J., Feb 2008, In : Annals of Pure and Applied Logic. 151, 2-3, p. 151-169 19 p.

Research output: Contribution to journalArticle

Open Access
15 Citations (Scopus)

Decidability and syntactic control of interference

Laird, J., 31 Mar 2008, In : Theoretical Computer Science. 394, 1-2, p. 64-83 20 p.

Research output: Contribution to journalArticle

1 Citation (Scopus)
2007

Bistable biorders: A sequential domain theory

Laird, J., 2007, In : Logical Methods in Computer Science. 3, 2, p. 1-22 22 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)
3 Citations (Scopus)

Sequentiality and the CPS semantics of fresh names

Laird, J., 2 Apr 2007, In : Electronic Notes in Theoretical Computer Science. 173, p. 203-219 17 p.

Research output: Contribution to journalArticle

Open Access
2006

A calculus of coroutines

Laird, J., 2006, In : Theoretical Computer Science. 350, 2-3, p. 275-291 17 p.

Research output: Contribution to journalArticle

3 Citations (Scopus)
2005

Game semantics and linear CPS interpretation

Laird, J., Mar 2005, In : Theoretical Computer Science. 333, 1-2, p. 199-224 26 p.

Research output: Contribution to journalArticle

9 Citations (Scopus)

Locally Boolean domains

Laird, J., Sep 2005, In : Theoretical Computer Science. 342, 1, p. 132-148 17 p.

Research output: Contribution to journalArticle

14 Citations (Scopus)

Sequentiality in bounded biorders

Laird, J., 2005, In : Fundamenta Informaticae. 65, 1-2, p. 173-191 19 p.

Research output: Contribution to journalArticle

5 Citations (Scopus)
2003

A categorical semantics of higher order store

Laird, J., Feb 2003, In : Electronic Notes in Theoretical Computer Science. 69, p. 209-226 18 p.

Research output: Contribution to journalArticle

Open Access
10 Citations (Scopus)
2001

A game semantics of idealized CSP

Laird, J., Nov 2001, In : Electronic Notes in Theoretical Computer Science. 45, p. 232-257

Research output: Contribution to journalArticle

Open Access
13 Citations (Scopus)