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

2020

A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λμ-Calculus

Laird, J., 2020, Foundations of Software Science and Computation Structures- 23rd International Conference, FOSSACS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings. Goubault-Larrecq, J. & König, B. (eds.). Cham, Switzerland: Springer, p. 422-441 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12077 LNCS).

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

Open Access
File
1 Downloads (Pure)
2019

From Global to Local State, Coalgebraically and Compositionally

Laird, J., 30 Nov 2019, In : Electronic Notes in Theoretical Computer Science. 347, p. 203-222 20 p.

Research output: Contribution to journalConference article

Open Access
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

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

Blot, V. & Laird, J., 31 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
12 Downloads (Pure)
2017
Open Access
1 Citation (Scopus)

From Qualitative to Quantitative Semantics by Change of Base

Laird, J., Apr 2017.

Research output: Contribution to conferencePaper

Open Access
File
2 Citations (Scopus)
52 Downloads (Pure)

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
28 Downloads (Pure)
2016

Fixed points in quantitative semantics

Laird, J., 5 Jul 2016, LICS '16, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science . Shankar, N. (ed.). New York, U. S. A.: Association for Computing Machinery, p. 347-356 10 p. (Proceedings - Symposium on Logic in Computer Science).

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

Open Access
File
5 Citations (Scopus)
129 Downloads (Pure)

Game semantics for bounded polymorphism

Laird, J., 22 Mar 2016, Foundations of Software Science and Computation Structures. FOSSACS 2016.: Proceedings of 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, Etaps 2016, Eindhoven, the Netherlands, April 2-8, 2016.. Jacobs, B. & Loding, C. (eds.). The Netherlands: Springer Verlag, p. 55-70 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9634).

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

Open Access
File
97 Downloads (Pure)

Polymorphic Game Semantics for Dynamic Binding

Laird, J., 1 Sep 2016.

Research output: Contribution to conferencePaper

Open Access

Weighted relational models for mobility

Laird, J., 1 Jun 2016, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 52. p. 1-15 15 p. 24

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

Open Access
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

Combining and Relating Control Operators and their Semantics

Laird, J., 2013, Control Operators and their Semantics. Elsevier, Vol. 127. p. 113-129 16 p. 8. (Electronic Proceedings in Theoretical Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

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)

Weighted relational models of typed Lambda-Calculi

Laird, J. D., Manzonetto, G., Mccusker, G. & Pagani, M., 1 Jun 2013, 2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS). Los Alamitos, California: IEEE, p. 301-310 10 p. (Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)).

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

Open Access
File
27 Citations (Scopus)
138 Downloads (Pure)
2011

Constructing differential categories and deconstructing categories of games

Laird, J., Manzonetto, G. & McCusker, G., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. Aceto, L., Henzinger, M. & Sgall, J. (eds.). Heidelberg, Germany: Springer, p. 186-197 12 p. (Lecture Notes in Computer Science; vol. 6756).

Research output: Chapter in Book/Report/Conference proceedingChapter

Open Access
File
4 Citations (Scopus)
101 Downloads (Pure)

Imperative programs as proofs via game semantics

Churchill, M., Laird, J. & McCusker, G., 2011, 26th Annual IEEE Symposium on Logic in Computer Science (LICS) 2011. IEEE, p. 65-74 10 p. (Annual Symposium on Logic in Computer Science).

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

File
3 Citations (Scopus)
115 Downloads (Pure)
2010

A logic of sequentiality

Churchill, M. & Laird, J., 24 Aug 2010, Computer Science Logic (Lecture Notes in Computer Science). Dawar, A. & Veith, H. (eds.). Springer, Vol. 6247/2. p. 215-229 15 p. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

File
5 Citations (Scopus)
29 Downloads (Pure)

Game semantics for a polymorphic programming language

Laird, J., 2010, 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010. IEEE, p. 41-49 9 p. (Proceedings - Symposium on Logic in Computer Science).

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

6 Citations (Scopus)

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)
2009

Nondeterminism and observable sequentiality

Laird, J., 2009, Computer Science Logic: 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings. Gradel, E. & Kahle, R. (eds.). Berlin: Springer, p. 379-393 15 p. (Lecture Notes in Computer Science; vol. 5771).

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

1 Citation (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

A fully abstract trace semantics for general references

Laird, J., Jul 2007, Automata, Languages and Programming: Proceedings of 34th International Colloquium, ICALP 2007, Wrocław, Poland, July 9-13, 2007. Arge, L., Cachin, C., Jurdziński, T. & Tarlecki, A. (eds.). Berlin, Germany: Springer Verlag, p. 667-679 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4596 ).

Research output: Chapter in Book/Report/Conference proceedingChapter

24 Citations (Scopus)

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)

Bidomains and full abstraction for countable nondeterminism

Laird, J., 2006, Foundations of Software Science and Computation Structures: Proceedings of the 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software , ETAPS 2006 Vienna, Austria, March 2006. Aceto, L. & Ingolfsdottir, A. (eds.). Berlin, Germany: Springer Verlag, p. 352-366 15 p. (Lecture Notes in Computer Science ; vol. 3921 ).

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

7 Citations (Scopus)

Game semantics for higher-order concurrency

Laird, J., 1 Jan 2006, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - 26th International Conference, Proceedings. Springer Verlag, p. 417-428 12 p. (Lecture Notes in Computer Science; vol. 4337 LNCS).

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

11 Citations (Scopus)
2005

A game semantics of the asynchronous π-calculus

Laird, J., 2005, CONCUR 2005 – Concurrency Theory: Proceedings of 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005. Abadi, M. & Alfaro, L. (eds.). Berlin, Germany: Springer Verlag, p. 51-65 15 p. (Lecture Notes in Computer Science; vol. 3653).

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

18 Citations (Scopus)

Decidability in syntactic control of interference

Laird, J., Jun 2005, Automata, Languages and Programming: Proceedings of the 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C. & Yung, M. (eds.). Berlin, Germany: Springer Verlag, p. 904-916 13 p. (Theoretical Computer Science and General Issues; vol. 3580, no. Edition 1).

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

2 Citations (Scopus)

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)

The elimination of nesting in SPCF

Laird, J., 2005, Typed Lambda Calculi and Applications: Proceedings of 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005. Urzyczyn, P. (ed.). Berlin, Germany: Springer Verlag, p. 234-245 12 p. (Lecture Notes in Computer Science; vol. 3461).

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

3 Citations (Scopus)
2004

A calculus of coroutines

Laird, J., 2004, Automata, Languages and Programming: Proceedings of 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004.. Diaz, J., Karhumaki, J., Lepisto, A. & Sannella, D. (eds.). Berlin, Germany: Springer Verlag, p. 882-893 12 p. (Lecture Notes in Computer Science; vol. 3142).

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

A game semantics of local names and good variables

Laird, J., 2004, Foundations of Software Science and Computation Structures: Proceedings of 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Walukiewicz, I. (ed.). Berlin, Germany: Springer Verlag, p. 289-303 15 p. (Lecture Notes in Computer Science; vol. 2987).

Research output: Chapter in Book/Report/Conference proceedingChapter

22 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)

A fully abstract bidomain model of unary FPC

Laird, J., 27 May 2003, Typed Lambda Calculi and Applications: Proceedings of 6th International Conference, TLCA 2003 Valencia, Spain, June 10–12, 2003 . Hofmann, M. (ed.). Berlin, Germany: Springer Verlag, p. 211-225 15 p. (Lecture Notes in Computer Science; vol. 2701).

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

A game semantics of linearly used continuations

Laird, J., 2003, Foundations of Software Science and Computation Structures: Proceedings of 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 . Gordon, A. D. (ed.). Berlin, Germany: Springer Verlag, p. 313-327 15 p. (Lecture Notes in Computer Science; vol. 2620).

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Bistability: an extensional characterization of sequentiality

Laird, J., 2003, Computer Science Logic: Proceedings of 17th International Workshop CSL 2003, 12th Annual Conference of the (EACSL), 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003. Baaz, M. & Makowsky, J. A. (eds.). Berlin, Germany: Springer Verlag, p. 372-383 12 p. (Lecture Notes in Computer Science; vol. 2803).

Research output: Chapter in Book/Report/Conference proceedingChapter

9 Citations (Scopus)
2002

Exceptions, continuations and macro-expressiveness

Laird, J., 14 Mar 2002, Programming Languages and Systems: Proceedings of 11th European Symposium on Programming, ESOP 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8–12, 2002. Le Metayer, D. (ed.). Berlin, Germany: Springer Verlag, p. 133-146 14 p. (Lecture Notes in Computer Science ; vol. 2305).

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

9 Citations (Scopus)
2001

A deconstruction of non-deterministic classical cut elimination

Laird, J., 2001, Typed Lambda Calculi and Applications: Proceedings of 5th International Conference, TLCA 2001 Kraków, Poland, May 2–5, 2001. Abramsky, S. (ed.). Berlin, Germany: Springer Verlag, p. 268-282 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2044 ).

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

1 Citation (Scopus)

A fully abstract game semantics of local exceptions

Laird, J., Jun 2001, Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science, 2001. IEEE, p. 105-114 10 p.

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

24 Citations (Scopus)

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)
1997

Full abstraction for functional languages with control

Laird, J., Dec 1997, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997. Anon (ed.). California, U. S. A.: IEEE, p. 58-67 10 p.

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

78 Citations (Scopus)