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: 16.

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. D., 2013. Game semantics for a polymorphic programming language. Journal of the ACM, 60 (4), 29.

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

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., 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. Vol. 6756. Heidelberg: Springer-Verlag, pp. 186-197. (Lecture Notes in Computer Science)

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

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-Verlag, pp. 215-229. (Lecture Notes in Computer Science)

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

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

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

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

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.

Aird, M.-L., Laird, J. and Ffitch, J., 2001. Extending Digital Waveguides To Include Material Modelling. In: Proceedings of DAFx01, 2001-12-01, University of Limerick.

This list was generated on Wed Apr 23 18:24:40 2014 IST.