Address:

        Department of Informatics
        University of Sussex At Brighton
        Falmer
        Brighton
        East Sussex
        BN1 9QH
        England

        Phone (0)1273 678763

        E-Mail: jiml at sussex.ac.uk
    

Trace Semantics

J. Laird. A Fully Abstract Trace Semantics for General References . To appear in the proceedings of ICALP '07 (in a slightly abridged version). 2007.

Game Semantics and Control

J. Laird. Game Semantics and linear CPS interpretation. Theoretical Computer Science 333 (2005) 199--224. 2005. Available as gzipped postscript

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. Available as gzipped postscript

J. Laird A calculus of coroutines In Theoretical Computer Science 350 (2006) 275-291 . Available as pdf 2005.

Extended abstract, in the proceedings of the International Colloquium on Automata, Languages and Programming, ICALP '04, 2004.Copyright Springer LNCS. Available as gzipped postscript

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. Available as gzipped postscript

J. Laird A semantic analysis of control. Phd thesis, University of Edinburgh, 1998. Abstract Available as gzipped postscript

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. Available as gzipped postscript

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. Available as gzipped postscript

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). Available as .pdf Also, a slightly longer version.

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). Available as .pdf

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). Available as gzipped postscript

Game Semantics and Sequential Algorithms

J. Laird Games and Sequential Algorithms. To appear.

Game Semantics of Functional-Imperative Languages

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). Available as .pdf

J. Laird A game semantics of names and pointers. To appear in Annals of Pure and Applied Logic Available as .pdf

J. Laird A 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. Available as gzipped postscript

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. Available as gzipped postscript

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. Available as gzipped postscript

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. Available as gzipped postscript

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.

J. Laird Locally Boolean Domains. In Theoretical Computer Science 342, 132 - 248 , 2005.

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

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). Available as .pdf

J. Laird On the Expressiveness of Affine Programs with Non-local Control:The Elimination of Nesting in SPCF To appear in Fundamenta Informaticae, 2007.

J. Laird Bistable Biorders: a Sequential Domain Theory Bistable Biorders: a Sequential Domain Theory To appear in LMCS, 2007.

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.

J. Laird Sequentiality in Bounded Biorders. In Fundamenta Informaticae 65(1,2) 173 -- 191..

J. Laird Bistability: an extensional characterization of sequentiality In the proceedings of Computer Science Logic (CSL), 2003. Copyright Springer LNCS.