Back to my home page.
View my research papers.
View my research projects.
EPSRC grant GR/S72181/01 and 02, value £165874, running November 2004-September 2007.
The goal of this project was to develop a rich semantic theory for modelling programming languages, based on game semantics, domain theory and the connections between them. Specifically, we aimed
This project employed Jim Laird.
The final report on the project describes the research outcomes of the work carried out with this EPSRC support.
J. Laird. Locally Boolean Domains. In Theoretical Computer Science 342, 132 - 248 , 2005.
J. Laird. Bidomains and Full Abstraction For Countable Nondeterminism An extended abstract appeard in the proceedings of Foundations of Software Science and Computation Structures, FoSSaCS '06, Springer LNCS (Number 3921).
J. Laird. The Elimination of Nesting in SPCF In the proceedings of Typed Lambda Calculi and Applications, TLCA '05, 2005.
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 To appear in LMCS, 2007.
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.
J. Laird. A Fully Abstract Trace Semantics for General References. To appear in the proceedings of ICALP '07 (in a slightly abridged version).
J. Laird. A calculus of coroutines In Theoretical Computer Science 350 (2006) 275-291 . An extended abstract appeared in the proceedings of the International Colloquium on Automata, Languages and Programming, ICALP '04, 2004.
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.
J. Laird. A Game Semantics of the asynchronous pi-calculus. In the proceedings of the 16th International Conference, CONCUR 2005.
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.
J. Laird. A game semantics of names and pointers. To appear in Annals of Pure and Applied Logic.
J. Laird. Sequentiality and the CPS Semantics of Fresh Names In ENTCS vol. 173. (Proceedings of MFPS XXIII) pages 203 - 219, 2007.
G. McCusker. Categorical models of Syntactic Control of Interference Revisited, Revisited (LMS J. Comput. Math (10) 176-216, June 2007.
G. McCusker and D. Pym. A games model of BI. In Proceedings, CSL 2007.