James Laird

View Scopus Profile

James Laird

Dr

 https://orcid.org/0000-0002-3636-8937

  • 1 WEST 4.64

Filter
Chapter in a published conference proceeding

Search results

  • 2023

    Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism

    Laird, J., 28 Jun 2023, 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023. Gaboardi, M. & van Raamsdonk, F. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 260).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
  • 2021

    A Compositional Cost Model for the λ-calculus

    Laird, J., 29 Jun 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021. IEEE, Vol. 2021-June. p. 1-13 9470567. (Proceedings - Symposium on Logic in Computer Science; vol. 2021-June).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    1 Citation (SciVal)
    194 Downloads (Pure)
  • 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 ; vol. 12077).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    58 Downloads (Pure)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    1 Citation (SciVal)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    1 Citation (SciVal)
    12 Downloads (Pure)
  • 2017

    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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    File
    1 Citation (SciVal)
    73 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    10 Citations (SciVal)
    291 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    1 Citation (SciVal)
    228 Downloads (Pure)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
  • 2013

    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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    63 Citations (SciVal)
    371 Downloads (Pure)
  • 2011

    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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    File
    4 Citations (SciVal)
    242 Downloads (Pure)
  • 2010

    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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    7 Citations (SciVal)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    1 Citation (SciVal)
  • 2006

    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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    8 Citations (SciVal)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    13 Citations (SciVal)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    23 Citations (SciVal)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    2 Citations (SciVal)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    3 Citations (SciVal)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    10 Citations (SciVal)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    2 Citations (SciVal)

  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    30 Citations (SciVal)
  • 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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    97 Citations (SciVal)