The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James Laird: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James Laird
    Finite Models and Full Completeness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:384-398 [Conf]
  2. James Laird
    Bistability: An Extensional Characterization of Sequentiality. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:372-383 [Conf]
  3. James Laird
    Exceptions, Continuations and Macro-expressiveness. [Citation Graph (0, 0)][DBLP]
    ESOP, 2002, pp:133-146 [Conf]
  4. James Laird
    A Game Semantics of Linearly Used Continuations. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:313-327 [Conf]
  5. James Laird
    A Game Semantics of Local Names and Good Variables. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:289-303 [Conf]
  6. James Laird
    Bidomains and Full Abstraction for Countable Nondeterminism. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:352-366 [Conf]
  7. James Laird
    Game Semantics for Higher-Order Concurrency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:417-428 [Conf]
  8. James Laird
    A game semantics of the asynchronous pi-calculus and its dual. [Citation Graph (0, 0)][DBLP]
    GALOP, 2005, pp:32-47 [Conf]
  9. James Laird
    A Calculus of Coroutines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:882-893 [Conf]
  10. James Laird
    Decidability in Syntactic Control of Interference. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:904-916 [Conf]
  11. James Laird
    A Fully Abstract Game Semantics of Local Exceptions. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:105-114 [Conf]
  12. James Laird
    Full Abstraction for Functional Languages with Control. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:58-67 [Conf]
  13. James Laird
    A Deconstruction of Non-deterministic Classical Cut Elimination. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:268-282 [Conf]
  14. James Laird
    A Fully Abstract Bidomain Model of Unary FPC. [Citation Graph (0, 0)][DBLP]
    TLCA, 2003, pp:211-225 [Conf]
  15. James Laird
    The Elimination of Nesting in SPCF. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:234-245 [Conf]
  16. James Laird
    A Game Semantics of Idealized CSP. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:45, n:, pp:- [Journal]
  17. James Laird
    A Categorical Semantics of Higher Order Store. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:69, n:, pp:- [Journal]
  18. James Laird
    Sequentiality and the CPS Semantics of Fresh Names. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:203-219 [Journal]
  19. James Laird
    Locally Boolean domains. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:1, pp:132-148 [Journal]
  20. James Laird
    A Fully Abstract Trace Semantics for General References. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:667-679 [Conf]
  21. James Laird
    Bistable Biorders: A Sequential Domain Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  22. James Laird
    On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:77, n:4, pp:511-531 [Journal]

  23. Nondeterminism and Observable Sequentiality. [Citation Graph (, )][DBLP]


  24. A Logic of Sequentiality. [Citation Graph (, )][DBLP]


  25. Game Semantics for Call-by-Value Polymorphism. [Citation Graph (, )][DBLP]


  26. Game Semantics for a Polymorphic Programming Language. [Citation Graph (, )][DBLP]


  27. A game semantics of names and pointers. [Citation Graph (, )][DBLP]


  28. A Concrete Representation of Observational Equivalence for PCF [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002