| |
Jim Laird
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 28 | EE | James Laird: A game semantics of names and pointers. Ann. Pure Appl. Logic 151(2-3): 151-169 (2008) |
| 27 | EE | James Laird: Decidability and syntactic control of interference. Theor. Comput. Sci. 394(1-2): 64-83 (2008) |
| 2007 | ||
| 26 | EE | James Laird: A Fully Abstract Trace Semantics for General References. ICALP 2007: 667-679 |
| 25 | EE | James Laird: Bistable Biorders: A Sequential Domain Theory CoRR abs/cs/0702169: (2007) |
| 24 | EE | James Laird: Sequentiality and the CPS Semantics of Fresh Names. Electr. Notes Theor. Comput. Sci. 173: 203-219 (2007) |
| 23 | EE | James Laird: On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF. Fundam. Inform. 77(4): 511-531 (2007) |
| 22 | EE | James Laird: Bistable Biorders: A Sequential Domain Theory. Logical Methods in Computer Science 3(2): (2007) |
| 2006 | ||
| 21 | EE | James Laird: Game Semantics for Higher-Order Concurrency. FSTTCS 2006: 417-428 |
| 20 | EE | James Laird: Bidomains and Full Abstraction for Countable Nondeterminism. FoSSaCS 2006: 352-366 |
| 2005 | ||
| 19 | EE | Jim Laird: A Game Semantics of the Asynchronous pi-Calculus. CONCUR 2005: 51-65 |
| 18 | James Laird: A game semantics of the asynchronous pi-calculus and its dual. GALOP 2005: 32-47 | |
| 17 | EE | James Laird: Decidability in Syntactic Control of Interference. ICALP 2005: 904-916 |
| 16 | EE | James Laird: The Elimination of Nesting in SPCF. TLCA 2005: 234-245 |
| 15 | EE | Jim Laird: Sequentiality in Bounded Biorders. Fundam. Inform. 65(1-2): 173-191 (2005) |
| 14 | EE | Jim Laird: Game semantics and linear CPS interpretation. Theor. Comput. Sci. 333(1-2): 199-224 (2005) |
| 13 | EE | James Laird: Locally Boolean domains. Theor. Comput. Sci. 342(1): 132-148 (2005) |
| 2004 | ||
| 12 | EE | James Laird: A Game Semantics of Local Names and Good Variables. FoSSaCS 2004: 289-303 |
| 11 | EE | James Laird: A Calculus of Coroutines. ICALP 2004: 882-893 |
| 2003 | ||
| 10 | EE | James Laird: Bistability: An Extensional Characterization of Sequentiality. CSL 2003: 372-383 |
| 9 | EE | James Laird: A Game Semantics of Linearly Used Continuations. FoSSaCS 2003: 313-327 |
| 8 | EE | James Laird: A Fully Abstract Bidomain Model of Unary FPC. TLCA 2003: 211-225 |
| 2002 | ||
| 7 | EE | James Laird: Exceptions, Continuations and Macro-expressiveness. ESOP 2002: 133-146 |
| 6 | EE | James Laird: A Categorical Semantics of Higher Order Store. Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 2001 | ||
| 5 | James Laird: A Fully Abstract Game Semantics of Local Exceptions. LICS 2001: 105-114 | |
| 4 | EE | James Laird: A Deconstruction of Non-deterministic Classical Cut Elimination. TLCA 2001: 268-282 |
| 3 | EE | James Laird: A Game Semantics of Idealized CSP. Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 2000 | ||
| 2 | EE | James Laird: Finite Models and Full Completeness. CSL 2000: 384-398 |
| 1997 | ||
| 1 | EE | James Laird: Full Abstraction for Functional Languages with Control. LICS 1997: 58-67 |