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

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. 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, New Orleans, LA, USA. 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., 2013. Combining and Relating Control Operators and their Semantics. 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. Heidelberg, Germany: Springer, pp. 186-197. (Lecture Notes in Computer Science; 6756)

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)

Churchill, M. and Laird, J., 2010. A logic of sequentiality. Springer, 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, July 11, 2010 - July 14, 2010, 2010-07-01, Edinburgh. 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., 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 Fri Feb 5 16:00:29 2016 GMT.