Travelled to:
1 × Canada
1 × Czech Republic
1 × Finland
1 × Germany
1 × Japan
1 × USA
1 × United Kingdom
2 × Austria
2 × France
2 × Portugal
2 × Spain
4 × Poland
Collaborated with:
∅ M.Churchill G.McCusker
Talks about:
semant (8) game (7) abstract (5) polymorph (3) sequenti (3) fulli (3) full (3) nondetermin (2) bidomain (2) program (2)
Person: James Laird
DBLP: Laird:James
Contributed to:
Wrote 20 papers:
- LICS-2011-ChurchillLM #game studies #imperative #proving #semantics #source code
- Imperative Programs as Proofs via Game Semantics (MC, JL, GM), pp. 65–74.
- CSL-2010-ChurchillL #logic
- A Logic of Sequentiality (MC, JL), pp. 215–229.
- ICALP-v2-2010-Laird #call-by #game studies #morphism #polymorphism #semantics
- Game Semantics for Call-by-Value Polymorphism (JL), pp. 187–198.
- LICS-2010-Laird #game studies #polymorphism #programming language #semantics
- Game Semantics for a Polymorphic Programming Language (JL), pp. 41–49.
- CSL-2009-Laird #nondeterminism
- Nondeterminism and Observable Sequentiality (JL), pp. 379–393.
- ICALP-2007-Laird #semantics
- A Fully Abstract Trace Semantics for General References (JL), pp. 667–679.
- FoSSaCS-2006-Laird #abstraction #nondeterminism
- Bidomains and Full Abstraction for Countable Nondeterminism (JL), pp. 352–366.
- ICALP-2005-Laird #decidability
- Decidability in Syntactic Control of Interference (JL), pp. 904–916.
- TLCA-2005-Laird
- The Elimination of Nesting in SPCF (JL), pp. 234–245.
- FoSSaCS-2004-Laird #game studies #semantics
- A Game Semantics of Local Names and Good Variables (JL), pp. 289–303.
- ICALP-2004-Laird #calculus
- A Calculus of Coroutines (JL), pp. 882–893.
- CSL-2003-Laird #named
- Bistability: An Extensional Characterization of Sequentiality (JL), pp. 372–383.
- FoSSaCS-2003-Laird #continuation #game studies #semantics
- A Game Semantics of Linearly Used Continuations (JL), pp. 313–327.
- TLCA-2003-Laird #domain model
- A Fully Abstract Bidomain Model of Unary FPC (JL), pp. 211–225.
- ESOP-2002-Laird #continuation #exception
- Exceptions, Continuations and Macro-expressiveness (JL), pp. 133–146.
- LICS-2001-Laird #exception #game studies #semantics
- A Fully Abstract Game Semantics of Local Exceptions (JL), pp. 105–114.
- TLCA-2001-Laird #nondeterminism
- A Deconstruction of Non-deterministic Classical Cut Elimination (JL), pp. 268–282.
- CSL-2000-Laird #finite #modelling
- Finite Models and Full Completeness (JL), pp. 384–398.
- LICS-1997-Laird #abstraction #functional
- Full Abstraction for Functional Languages with Control (JL), pp. 58–67.
- CSL-2016-Laird #game studies #polymorphism #semantics
- Polymorphic Game Semantics for Dynamic Binding (JL), p. 16.