dblp.uni-trier.dewww.uni-trier.de

James Laird Vis

Jim Laird

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)