James Laird

54 papers A* 9A 1B 18Journal 15Unranked 11
YearRankTypeTitle / Venue / Authors
2024 — conf
Investigating HuBERT-Based Speech Emotion Recognition Generalisation Capability.
ICAISC (1)
Letian Li, Cornelius Glackin, Nigel Cannings, Vito Veneziano, Jack Barker, Olakunle Oduola, Chris Woodruff, Thea Laird, James Laird, Yi Sun
2023 J jnl
Deception detection in conversations using the proximity of linguistic markers.
Knowl. Based Syst.
Nikesh Bajaj, Marvin Rajwadi, Tracy Goodluck Constance, Julie A. Wall, Mansour Moniri, Thea Laird, Chris Woodruff, James Laird, Cornelius Glackin, Nigel Cannings
2023 B conf
Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism.
FSCD
James Laird
2022 B conf
Revisiting Decidable Bounded Quantification, via Dinaturality.
MFPS
James Laird
2022 — conf
Speaker Recognition using Multiple X-Vector Speaker Representations with Two-Stage Clustering and Outlier Detection Refinement.
DASC/PiCom/CBDCom/CyberSciTech
Roman Shrestha, Cornelius Glackin, Julie A. Wall, Nigel Cannings, Marvin Rajwadi, Satya Kada, James Laird, Thea Laird, Chris Woodruff
2021 A* conf
A Compositional Cost Model for the λ-calculus.
LICS
James Laird
2021 J jnl
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism.
Log. Methods Comput. Sci.
James Laird
2021 — conf
Resolving Ambiguity in Hedge Detection by Automatic Generation of Linguistic Rules.
ICANN (5)
Tracy Goodluck Constance, Nikesh Bajaj, Marvin Rajwadi, Harry Maltby, Julie A. Wall, Mansour Moniri, Chris Woodruff, Thea Laird, James Laird, Cornelius Glackin, Nigel Cannings
2020 B conf
A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus.
FoSSaCS
James Laird
2020 J jnl
Weighted models for higher-order computation.
Inf. Comput.
James Laird
2019 J jnl
Fraud detection in telephone conversations for financial services using linguistic features.
CoRR
Nikesh Bajaj, Tracy Goodluck Constance, Marvin Rajwadi, Julie A. Wall, Mansour Moniri, Cornelius Glackin, Nigel Cannings, Chris Woodruff, James Laird
2017 J jnl
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects.
Ann. Pure Appl. Log.
James Laird
2017 B conf
From Qualitative to Quantitative Semantics - By Change of Base.
FoSSaCS
James Laird
2017 J jnl
Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism.
CoRR
James Laird
2017 B conf
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics.
CALCO
William John Gowers, James Laird
2017 J jnl
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics.
CoRR
William John Gowers, James Laird
2016 A* conf
Fixed Points In Quantitative Semantics.
LICS
James Laird
2016 B conf
Game Semantics for Bounded Polymorphism.
FoSSaCS
James Laird
2016 B conf
Polymorphic Game Semantics for Dynamic Binding.
CSL
James Laird
2016 B conf
Weighted Relational Models for Mobility.
FSCD
James Laird
2015 B conf
Sequential Algorithms for Unbounded Nondeterminism.
MFPS
James Laird
2013 — conf
Combining and Relating Control Effects and their Semantics.
COS
James Laird
2013 J jnl
Game semantics for a polymorphic programming language.
J. ACM
James Laird
2011 A* conf
Imperative Programs as Proofs via Game Semantics.
LICS
Martin Churchill, James Laird, Guy McCusker
2010 J jnl
A Concrete Representation of Observational Equivalence for PCF
CoRR
Martin Churchill, James Laird, Guy McCusker
2010 B conf
A Logic of Sequentiality.
CSL
Martin Churchill, James Laird
2010 — conf
Game Semantics for Call-by-Value Polymorphism.
ICALP (2)
James Laird
2010 A* conf
Game Semantics for a Polymorphic Programming Language.
LICS
James Laird
2009 B conf
Nondeterminism and Observable Sequentiality.
CSL
James Laird
2008 J jnl
A game semantics of names and pointers.
Ann. Pure Appl. Log.
James Laird
2008 J jnl
Decidability and syntactic control of interference.
Theor. Comput. Sci.
James Laird
2007 A* conf
A Fully Abstract Trace Semantics for General References.
ICALP
James Laird
2007 J jnl
Bistable Biorders: A Sequential Domain Theory
CoRR
James Laird
2007 J jnl
Bistable Biorders: A Sequential Domain Theory.
Log. Methods Comput. Sci.
James Laird
2007 J jnl
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF.
Fundam. Informaticae
James Laird
2007 B conf
Sequentiality and the CPS Semantics of Fresh Names.
MFPS
James Laird
2006 B conf
Bidomains and Full Abstraction for Countable Nondeterminism.
FoSSaCS
James Laird
2006 — conf
Game Semantics for Higher-Order Concurrency.
FSTTCS
James Laird
2005 — conf
A game semantics of the asynchronous pi-calculus and its dual.
GALOP@ETAPS
James Laird
2005 A* conf
Decidability in Syntactic Control of Interference.
ICALP
James Laird
2005 J jnl
Locally Boolean domains.
Theor. Comput. Sci.
James Laird
2005 — conf
The Elimination of Nesting in SPCF.
TLCA
James Laird
2004 A* conf
A Calculus of Coroutines.
ICALP
James Laird
2004 B conf
A Game Semantics of Local Names and Good Variables.
FoSSaCS
James Laird
2003 — conf
A Fully Abstract Bidomain Model of Unary
TLCA
James Laird
2003 B conf
A Game Semantics of Linearly Used Continuations.
FoSSaCS
James Laird
2003 B conf
Bistability: An Extensional Characterization of Sequentiality.
CSL
James Laird
2002 — conf
A Categorical Semantics of Higher Order Store.
CTCS
James Laird
2002 A conf
Exceptions, Continuations and Macro-expressiveness.
ESOP
James Laird
2001 — conf
A Deconstruction of Non-deterministic Classical Cut Elimination.
TLCA
James Laird
2001 A* conf
A Fully Abstract Game Semantics of Local Exceptions.
LICS
James Laird
2001 B conf
A Game Semantics of Idealized CSP.
MFPS
James Laird
2000 B conf
Finite Models and Full Completeness.
CSL
James Laird
1997 A* conf
Full Abstraction for Functional Languages with Control.
LICS
James Laird