Research

Items by Laird, James

Up a level
Export as [feed] RSS 1.0 [feed] Atom [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 42.

Book Sections

Laird, J., 2013. Combining and Relating Control Operators and their Semantics. In: Control Operators and their Semantics.Vol. 127. Elsevier, pp. 113-129. (Electronic Proceedings in Theoretical Computer Science)

Laird, J., Manzonetto, G. and McCusker, G., 2011. Constructing differential categories and deconstructing categories of games. In: Aceto, L., Henzinger, M. and Sgall, J., eds. Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. Heidelberg, Germany: Springer, pp. 186-197. (Lecture Notes in Computer Science; 6756)

Churchill, M. and Laird, J., 2010. A logic of sequentiality. In: Dawar, A. and Veith, H., eds. Computer Science Logic (Lecture Notes in Computer Science).Vol. 6247/2. Springer, pp. 215-229. (Lecture Notes in Computer Science)

Laird, J., 2007. A fully abstract trace semantics for general references. In: Arge, L., Cachin, C., Jurdziński, T. and Tarlecki, A., eds. Automata, Languages and Programming. Berlin, Germany: Springer Verlag, pp. 667-679. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 4596)

Laird, J., 2004. A calculus of coroutines. In: Diaz, J., Karhumaki, J., Lepisto, A. and Sannella, D., eds. Automata, Languages and Programming. Berlin, Germany: Springer Verlag, pp. 882-893. (Lecture Notes in Computer Science; 3142)

Laird, J., 2004. A game semantics of local names and good variables. In: Walukiewicz, I., ed. Foundations of Software Science and Computation Structures. Berlin, Germany: Springer Verlag, pp. 289-303. (Lecture Notes in Computer Science; 2987)

Laird, J., 2003. A fully abstract bidomain model of unary FPC. In: Hofmann, M., ed. Typed Lambda Calculi and Applications. Berlin, Germany: Springer Verlag, pp. 211-225. (Lecture Notes in Computer Science; 2701)

Laird, J., 2003. A game semantics of linearly used continuations. In: Gordon, A. D., ed. Foundations of Software Science and Computation Structures. Berlin, Germany: Springer Verlag, pp. 313-327. (Lecture Notes in Computer Science; 2620)

Laird, J., 2003. Bistability:an extensional characterization of sequentiality. In: Baaz, M. and Makowsky, J. A., eds. Computer Science Logic. Berlin, Germany: Springer Verlag, pp. 372-383. (Lecture Notes in Computer Science; 2803)

Articles

Laird, J., 2015. Sequential algorithms for unbounded nondeterminism. Electronic Notes in Theoretical Computer Science, 319, pp. 271-287.

Churchill, M., Laird, J. and McCusker, G., 2013. Imperative programs as proofs via game semantics. Annals of Pure and Applied Logic, 164 (11), pp. 1038-1078.

Laird, J., Manzonetto, G. and McCusker, G., 2013. Constructing differential categories and deconstructing categories of games. Information and Computation, 222, pp. 247-264.

Laird, J., 2010. Game semantics for call-by-value polymorphism. Lecture Notes in Computer Science, 6199 LNCS, pp. 187-198.

Laird, J., 2008. Decidability and syntactic control of interference. Theoretical Computer Science, 394 (1-2), pp. 64-83.

Laird, J., 2008. A game semantics of names and pointers. Annals of Pure and Applied Logic, 151 (2-3), pp. 151-169.

Laird, J., 2007. Sequentiality and the CPS semantics of fresh names. Electronic Notes in Theoretical Computer Science, 173, pp. 203-219.

Laird, J., 2007. Bistable biorders: A sequential domain theory. Logical Methods in Computer Science, 3 (2), pp. 1-22.

Laird, J., 2006. A calculus of coroutines. Theoretical Computer Science, 350 (2-3), pp. 275-291.

Laird, J., 2005. Locally Boolean domains. Theoretical Computer Science, 342 (1), pp. 132-148.

Laird, J., 2005. Game semantics and linear CPS interpretation. Theoretical Computer Science, 333 (1-2), pp. 199-224.

Laird, J., 2005. Sequentiality in bounded biorders. Fundamenta Informaticae, 65 (1-2), pp. 173-191.

Laird, J., 2003. A categorical semantics of higher order store. Electronic Notes in Theoretical Computer Science, 69, pp. 209-226.

Laird, J., 2001. A game semantics of idealized CSP. Electronic Notes in Theoretical Computer Science, 45, pp. 232-257.

Conference or Workshop Items

Laird, J., 2016. Weighted relational models for mobility. In: 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, 2016-06-22 - 2016-06-26. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.

Laird, J., 2016. Game semantics for bounded polymorphism. In: Jacobs, B. and Loding, C., eds. 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016 and Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, 2016-04-02 - 2016-04-08. The Netherlands: Springer Verlag, pp. 55-70. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 9634) Item availability may be restricted.

Laird, J. D., Manzonetto, G., Mccusker, G. and Pagani, M., 2013. Weighted relational models of typed Lambda-Calculi. In: 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), 2013-06-25 - 2013-06-28. Los Alamitos, California: IEEE, pp. 301-310. (Annual IEEE/ACM Symposium on Logic in Computer Science (LICS))

Churchill, M., Laird, J. and McCusker, G., 2011. Imperative programs as proofs via game semantics. IEEE, pp. 65-74. (Annual Symposium on Logic in Computer Science)

Laird, J., 2010. Game semantics for a polymorphic programming language. In: 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010, 2010-07-01. IEEE, pp. 41-49. (Proceedings - Symposium on Logic in Computer Science)

Laird, J., 2009. Nondeterminism and observable sequentiality. Berlin: Springer, pp. 379-393. (Lecture Notes in Computer Science; 5771)

Laird, J., 2006. Bidomains and full abstraction for countable nondeterminism. In: Aceto, L. and Ingolfsdottir, A., eds. 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, 2006-03-25 - 2006-03-31. Berlin, Germany: Springer Verlag, pp. 352-366. (Lecture Notes in Computer Science; 3921)

Laird, J., 2005. Decidability in syntactic control of interference. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C. and Yung, M., eds. 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, 2005-07-11 - 2005-07-15. Berlin, Germany: Springer Verlag, pp. 904-916. (Theoretical Computer Science and General Issues; 3580/Edition 1)

Laird, J., 2005. A game semantics of the asynchronous π-calculus. In: Abadi, M. and Alfaro, L., eds. 16th International Conference on Concurrency Theory, CONCUR 2005, 2005-08-23 - 2005-08-26. Berlin, Germany: Springer Verlag, pp. 51-65. (Lecture Notes in Computer Science; 3653)

Laird, J., 2005. The elimination of nesting in SPCF. In: Urzyczyn, P., ed. 7th International Conference on Typed Lambda Calculi and Applications, TLCA 2005, 2005-04-21 - 2005-04-23. Berlin, Germany: Springer Verlag, pp. 234-245. (Lecture Notes in Computer Science; 3461)

Laird, J., 2002. Exceptions, continuations and macro-expressiveness. In: Le Metayer, D., ed. 11th European Symposium on Programming, ESOP 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, 2002-04-08 - 2002-04-12. Berlin, Germany: Springer Verlag, pp. 133-146. (Lecture Notes in Computer Science; 2305)

Laird, J., 2001. A fully abstract game semantics of local exceptions. In: 16th Annual IEEE Symposium on Logic in Computer Science, 2001-06-16 - 2001-06-19. IEEE, pp. 105-114.

Laird, J., 2001. A deconstruction of non-deterministic classical cut elimination. In: Abramsky, S., ed. 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, 2001-05-02 - 2001-05-05. Berlin, Germany: Springer Verlag, pp. 268-282. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 2044)

Laird, J., 1997. Full abstraction for functional languages with control. In: Anon,, ed. 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997, 1997-06-29 - 1997-07-02. California, U. S. A.: IEEE, pp. 58-67.

This list was generated on Sun Aug 28 06:25:57 2016 IST.