Trace Semantics

J. Laird. A Fully Abstract Trace Semantics for General References . In the proceedings of ICALP '07 (in a slightly abridged version). 2007.Game Semantics and linear CPS interpretation. Theoretical Computer Science 333 (2005) 199--224. 2005. More details
J. Laird A game semantics of linearly used continuations. Extended abstract, in the proceedings of Foundations of Software Science and Computation Structures, FoSSaCS '03, 2003.Copyright Springer LNCS.More details.
J. Laird A calculus of coroutines In Theoretical Computer Science 350 (2006) 275-291 .More details. 2005.
Extended abstract, in the proceedings of the International Colloquium on Automata, Languages and Programming, ICALP '04, 2004.Copyright Springer LNCS. More details
J. Laird A fully abstract games semantics of local exceptions. Extended abstract, in the proceedings of the 16th Annual Symposium on Logic in Computer Science, LICS '01, 2001. More details.
J. Laird A semantic analysis of control. Phd thesis, University of Edinburgh, 1998. More details.
J. Laird Full abstraction for functional languages with control. Extended abstract, in the proceedings of the 12th Annual Symposium on Logic in Computer Science, LICS '97, 1997. More details.

Macro-expressiveness and Control

J. Laird Exceptions, continuations and macro-expressiveness. In the proceedings of the European Symposium on Programming, ESOP 2002. Copyright Springer LNCS. More Details.

Game Semantics of Concurrency

J. Laird A Game Semantics of Higher-Order Concurrency. In the proceedings of the 26th International Conference on Foundations of Software Technology and Computer Science (FSTTCS), 2006. Copyright Springer LNCS (Number 4337). More details
J. Laird A Game Semantics of the asynchronous pi-calculus. In the proceedings of the 16th International Conference, CONCUR 2005. Copyright Springer LNCS (Number 3653). More details.
J. Laird A Game Semantics of Idealized CSP. In the proceedings of the 17th Annual Conference on Mathematical Foundations of Programming Semantics, MFPS '01 (Eds. Stephen Brookes and Michael Mislove), 2001. Volume 45, Electronic notes in Theoretical Computer Science (Elsevier).

Game Semantics of Functional-Imperative Languages

J. Laird Decidability in Syntactic Control of Interference. In Theoretical Computer Science. More details.
J. Laird Decidability in Syntactic Control of Interference. Extended abstract, in the proceedings of the International Conference on Automata, Languages and Programming ICALP '05, 2005.Copyright Springer LNCS (Number 3580). More details.
J. Laird A game semantics of names and pointers. In Annals of Pure and Applied Logic. More details.
J. Laird gA game semantics of local names and good variables. Extended abstract, in the proceedings of Foundations of Software Science and Computation Structures, FoSSaCS '04, 2004.Copyright Springer LNCS. More details.
J. Laird A Categorical Semantics of Higher-Order Store. To appear in the proceedings of the 9th Conference on Category Theory and Computer Science, CTCS '02, Electronic notes in Theoretical Computer Science (Elsevier), 2002. More details.

Classical Logic

J. Laird A Deconstruction of Non-deterministic Classical Cut Elimination. Extended abstract, in the proceedings of the 5th International Conference on Typed Lambda Calculus and Applications, TLCA 2001 (Ed. Samson Abramsky). Springer LNCS vol. 2044.

Functional Languages

J. Laird <Finite Models and Full Completeness. Extended abstract, in the proceedings of the 14th International Workshop on Computer Science Logic, CSL 2000 (Eds. Peter G. Clote and Helmut Schwichtenburg). Springer LNCS vol. 1862.

Bidomains and Bistability

J. Laird Sequentiality and the CPS Semantics of Fresh Names In ENTCS vol. 173. (Proceedings of MFPS XXIII) pages 203 - 219, 2007. More details.
J. Laird Locally Boolean Domains. In Theoretical Computer Science 342, 132 - 248 , 2005.More details.
J. Laird Bidomains and Full Abstraction For Countable Nondeterminism Extended abstract, in the proceedings of Foundations of Software Science and Computation Structures, FoSSaCS '06, Springer LNCS (Number 3921).Copyright Springer Verlag . More details.
J. Laird The Elimination of Nesting in SPCF Extended abstract, in the proceedings of Typed Lambda Calculi and Applications, TLCA '05, 2005.Copyright Springer LNCS (Number 3461).
J. Laird On the Expressiveness of Affine Programs with Non-local Control:The Elimination of Nesting in SPCF In Fundamenta Informaticae, 2007. More details.
J. Laird Bistable Biorders: a Sequential Domain Theory Bistable Biorders: a Sequential Domain Theory In Logical Methods in Computer Science, 2007. More details.
J. Laird A Fully Abstract Bidomain Model of Unary FPC. In the proceedings of the 5th International Conference on Typed Lambda-Calculi and Applications, TLCA '03. Copyright Springer LNCS. . More details.
J. Laird Sequentiality in Bounded Biorders. In Fundamenta Informaticae 65(1,2) 173 -- 191.. More details.
J. Laird Bistability: an extensional characterization of sequentiality In the proceedings of Computer Science Logic (CSL), 2003. Copyright Springer LNCS. More details.