James Laird

According to our database, James Laird authored at least 59 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Deception detection in conversations using the proximity of linguistic markers.

Nikesh Bajaj, Marvin Rajwadi, Tracy Goodluck Constance, Julie A. Wall, Mansour Moniri, Thea Laird, Chris Woodruff, James Laird, Cornelius Glackin, Nigel Cannings

Knowl. Based Syst., 2023

Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism.

James Laird

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

Revisiting Decidable Bounded Quantification, via Dinaturality.

James Laird

Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

Speaker Recognition using Multiple X-Vector Speaker Representations with Two-Stage Clustering and Outlier Detection Refinement.

Roman Shrestha, Cornelius Glackin, Julie A. Wall, Nigel Cannings, Marvin Rajwadi, Satya Kada, James Laird, Thea Laird, Chris Woodruff

Proceedings of the IEEE Intl. Conf. on Dependable, 2022

2021

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism.

James Laird

Log. Methods Comput. Sci., 2021

A Compositional Cost Model for the λ-calculus.

James Laird

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Resolving Ambiguity in Hedge Detection by Automatic Generation of Linguistic Rules.

Tracy Goodluck Constance, Nikesh Bajaj, Marvin Rajwadi, Harry Maltby, Julie A. Wall, Mansour Moniri, Chris Woodruff, Thea Laird, James Laird, Cornelius Glackin, Nigel Cannings

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2021, 2021

2020

Weighted models for higher-order computation.

James Laird

Inf. Comput., 2020

A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus.

James Laird

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019

From Global to Local State, Coalgebraically and Compositionally.

Jim Laird

Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

Fraud detection in telephone conversations for financial services using linguistic features.

Nikesh Bajaj, Tracy Goodluck Constance, Marvin Rajwadi, Julie A. Wall, Mansour Moniri, Cornelius Glackin, Nigel Cannings, Chris Woodruff, James Laird

CoRR, 2019

2018

Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types.

Valentin Blot, Jim Laird

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Fully Abstract Game Semantics for Countable Nondeterminism.

William John Gowers, James David Laird

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism.

James Laird

CoRR, 2017

Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects.

James Laird

Ann. Pure Appl. Log., 2017

From Qualitative to Quantitative Semantics - By Change of Base.

James Laird

Proceedings of the Foundations of Software Science and Computation Structures, 2017

Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics.

William John Gowers, James Laird

Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016

Weighted Relational Models for Mobility.

James Laird

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Fixed Points In Quantitative Semantics.

James Laird

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Game Semantics for Bounded Polymorphism.

James Laird

Proceedings of the Foundations of Software Science and Computation Structures, 2016

Polymorphic Game Semantics for Dynamic Binding.

James Laird

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Sequential Algorithms for Unbounded Nondeterminism.

James Laird

Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

2013

Game semantics for a polymorphic programming language.

James Laird

J. ACM, 2013

Constructing differential categories and deconstructing categories of games.

Jim Laird, Giulio Manzonetto, Guy McCusker

Inf. Comput., 2013

Combining and Relating Control Effects and their Semantics.

James Laird

Proceedings of the Proceedings First Workshop on Control Operators and their Semantics, 2013

Imperative programs as proofs via game semantics.

Martin Churchill, Jim Laird, Guy McCusker

Ann. Pure Appl. Log., 2013

Weighted Relational Models of Typed Lambda-Calculi.

Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2010

A Concrete Representation of Observational Equivalence for PCF

Martin Churchill, James Laird, Guy McCusker

CoRR, 2010

Game Semantics for Call-by-Value Polymorphism.

James Laird

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

A Logic of Sequentiality.

Martin Churchill, James Laird

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Nondeterminism and Observable Sequentiality.

James Laird

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Decidability and syntactic control of interference.

James Laird

Theor. Comput. Sci., 2008

A game semantics of names and pointers.

James Laird

Ann. Pure Appl. Log., 2008

2007

Bistable Biorders: A Sequential Domain Theory.

James Laird

Log. Methods Comput. Sci., 2007

On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF.

James Laird

Fundam. Informaticae, 2007

Sequentiality and the CPS Semantics of Fresh Names.

James Laird

Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

A Fully Abstract Trace Semantics for General References.

James Laird

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Game Semantics for Higher-Order Concurrency.

James Laird

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Bidomains and Full Abstraction for Countable Nondeterminism.

James Laird

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Locally Boolean domains.

James Laird

Theor. Comput. Sci., 2005

Game semantics and linear CPS interpretation.

Jim Laird

Theor. Comput. Sci., 2005

Sequentiality in Bounded Biorders.

Jim Laird

Fundam. Informaticae, 2005

The Elimination of Nesting in SPCF.

James Laird

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

Decidability in Syntactic Control of Interference.

James Laird

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A game semantics of the asynchronous pi-calculus and its dual.

James Laird

Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

A Game Semantics of the Asynchronous <i>pi</i>-Calculus.

Jim Laird

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

A Calculus of Coroutines.

James Laird

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

A Game Semantics of Local Names and Good Variables.

James Laird

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

A Fully Abstract Bidomain Model of Unary <i>FPC</i>.

James Laird

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

A Game Semantics of Linearly Used Continuations.

James Laird

Proceedings of the Foundations of Software Science and Computational Structures, 2003

Bistability: An Extensional Characterization of Sequentiality.

James Laird

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

A Categorical Semantics of Higher Order Store.

James Laird

Proceedings of the Category Theory and Computer Science, 2002

Exceptions, Continuations and Macro-expressiveness.

James Laird

Proceedings of the Programming Languages and Systems, 2002

2001

A Game Semantics of Idealized CSP.

James Laird

Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

A Deconstruction of Non-deterministic Classical Cut Elimination.

James Laird

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

A Fully Abstract Game Semantics of Local Exceptions.

James Laird

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000

Finite Models and Full Completeness.

James Laird

Proceedings of the Computer Science Logic, 2000

1999

A semantic analysis of control.

James David Laird

PhD thesis, 1999

1997

Full Abstraction for Functional Languages with Control.

James Laird

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997