default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Laird
2020 – today
- 2024
[c45]Letian Li
, Cornelius Glackin, Nigel Cannings, Vito Veneziano, Jack Barker, Olakunle Oduola, Chris Woodruff, Thea Laird, James Laird, Yi Sun:
Investigating HuBERT-Based Speech Emotion Recognition Generalisation Capability. ICAISC (1) 2024: 184-194- 2023
- [j14]Nikesh Bajaj, Marvin Rajwadi, Tracy Goodluck Constance, Julie A. Wall, Mansour Moniri, Thea Laird, Chris Woodruff, James Laird, Cornelius Glackin, Nigel Cannings:
Deception detection in conversations using the proximity of linguistic markers. Knowl. Based Syst. 267: 110422 (2023) - [c44]James Laird:
Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism. FSCD 2023: 33:1-33:16 - 2022
- [c43]Roman Shrestha, Cornelius Glackin, Julie A. Wall, Nigel Cannings, Marvin Rajwadi, Satya Kada, James Laird, Thea Laird, Chris Woodruff:
Speaker Recognition using Multiple X-Vector Speaker Representations with Two-Stage Clustering and Outlier Detection Refinement. DASC/PiCom/CBDCom/CyberSciTech 2022: 1-6 - [c42]James Laird:
Revisiting Decidable Bounded Quantification, via Dinaturality. MFPS 2022 - 2021
- [j13]James Laird:
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism. Log. Methods Comput. Sci. 17(4) (2021) - [c41]Tracy Goodluck Constance, Nikesh Bajaj, Marvin Rajwadi, Harry Maltby, Julie A. Wall, Mansour Moniri, Chris Woodruff, Thea Laird, James Laird, Cornelius Glackin, Nigel Cannings:
Resolving Ambiguity in Hedge Detection by Automatic Generation of Linguistic Rules. ICANN (5) 2021: 369-380 - [c40]James Laird:
A Compositional Cost Model for the λ-calculus. LICS 2021: 1-13 - 2020
- [j12]James Laird:
Weighted models for higher-order computation. Inf. Comput. 275: 104645 (2020) - [c39]James Laird:
A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus. FoSSaCS 2020: 422-441
2010 – 2019
- 2019
- [c38]Jim Laird:
From Global to Local State, Coalgebraically and Compositionally. MFPS 2019: 203-222 - [i6]Nikesh Bajaj, Tracy Goodluck Constance, Marvin Rajwadi, Julie A. Wall, Mansour Moniri, Cornelius Glackin, Nigel Cannings, Chris Woodruff, James Laird:
Fraud detection in telephone conversations for financial services using linguistic features. CoRR abs/1912.04748 (2019) - 2018
- [c37]William John Gowers, James David Laird:
A Fully Abstract Game Semantics for Countable Nondeterminism. CSL 2018: 24:1-24:18 - [c36]Valentin Blot, Jim Laird:
Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types. LICS 2018: 95-104 - 2017
- [j11]James Laird:
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects. Ann. Pure Appl. Log. 168(2): 470-500 (2017) - [c35]William John Gowers, James Laird:
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics. CALCO 2017: 13:1-13:17 - [c34]James Laird:
From Qualitative to Quantitative Semantics - By Change of Base. FoSSaCS 2017: 36-52 - [i5]William John Gowers, James Laird:
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics. CoRR abs/1706.00035 (2017) - [i4]James Laird:
Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism. CoRR abs/1710.10203 (2017) - 2016
- [c33]James Laird:
Polymorphic Game Semantics for Dynamic Binding. CSL 2016: 27:1-27:16 - [c32]James Laird:
Game Semantics for Bounded Polymorphism. FoSSaCS 2016: 55-70 - [c31]James Laird:
Fixed Points In Quantitative Semantics. LICS 2016: 347-356 - [c30]James Laird:
Weighted Relational Models for Mobility. FSCD 2016: 24:1-24:15 - 2015
- [c29]James Laird:
Sequential Algorithms for Unbounded Nondeterminism. MFPS 2015: 271-287 - 2013
- [j10]Martin Churchill, Jim Laird, Guy McCusker:
Imperative programs as proofs via game semantics. Ann. Pure Appl. Log. 164(11): 1038-1078 (2013) - [j9]Jim Laird, Giulio Manzonetto, Guy McCusker:
Constructing differential categories and deconstructing categories of games. Inf. Comput. 222: 247-264 (2013) - [j8]James Laird:
Game semantics for a polymorphic programming language. J. ACM 60(4): 29:1-29:27 (2013) - [c28]Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani:
Weighted Relational Models of Typed Lambda-Calculi. LICS 2013: 301-310 - [c27]James Laird:
Combining and Relating Control Effects and their Semantics. COS 2013: 113-129 - [i3]Martin Churchill, Jim Laird, Guy McCusker:
Imperative Programs as Proofs via Game Semantics. CoRR abs/1307.2004 (2013) - 2011
- [c26]Jim Laird, Giulio Manzonetto, Guy McCusker:
Constructing Differential Categories and Deconstructing Categories of Games. ICALP (2) 2011: 186-197 - [c25]Martin Churchill, James Laird, Guy McCusker:
Imperative Programs as Proofs via Game Semantics. LICS 2011: 65-74 - 2010
- [c24]Martin Churchill, James Laird:
A Logic of Sequentiality. CSL 2010: 215-229 - [c23]James Laird:
Game Semantics for Call-by-Value Polymorphism. ICALP (2) 2010: 187-198 - [c22]James Laird:
Game Semantics for a Polymorphic Programming Language. LICS 2010: 41-49 - [i2]Martin Churchill, James Laird, Guy McCusker:
A Concrete Representation of Observational Equivalence for PCF. CoRR abs/1003.0107 (2010)
2000 – 2009
- 2009
- [c21]James Laird:
Nondeterminism and Observable Sequentiality. CSL 2009: 379-393 - 2008
- [j7]James Laird:
A game semantics of names and pointers. Ann. Pure Appl. Log. 151(2-3): 151-169 (2008) - [j6]James Laird:
Decidability and syntactic control of interference. Theor. Comput. Sci. 394(1-2): 64-83 (2008) - 2007
- [j5]James Laird:
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF. Fundam. Informaticae 77(4): 511-531 (2007) - [j4]James Laird:
Bistable Biorders: A Sequential Domain Theory. Log. Methods Comput. Sci. 3(2) (2007) - [c20]James Laird:
A Fully Abstract Trace Semantics for General References. ICALP 2007: 667-679 - [c19]James Laird:
Sequentiality and the CPS Semantics of Fresh Names. MFPS 2007: 203-219 - [i1]James Laird:
Bistable Biorders: A Sequential Domain Theory. CoRR abs/cs/0702169 (2007) - 2006
- [c18]James Laird:
Bidomains and Full Abstraction for Countable Nondeterminism. FoSSaCS 2006: 352-366 - [c17]James Laird:
Game Semantics for Higher-Order Concurrency. FSTTCS 2006: 417-428 - 2005
- [j3]Jim Laird:
Sequentiality in Bounded Biorders. Fundam. Informaticae 65(1-2): 173-191 (2005) - [j2]Jim Laird:
Game semantics and linear CPS interpretation. Theor. Comput. Sci. 333(1-2): 199-224 (2005) - [j1]James Laird:
Locally Boolean domains. Theor. Comput. Sci. 342(1): 132-148 (2005) - [c16]Jim Laird:
A Game Semantics of the Asynchronous pi-Calculus. CONCUR 2005: 51-65 - [c15]James Laird:
A game semantics of the asynchronous pi-calculus and its dual. GALOP@ETAPS 2005: 32-47 - [c14]James Laird:
Decidability in Syntactic Control of Interference. ICALP 2005: 904-916 - [c13]James Laird:
The Elimination of Nesting in SPCF. TLCA 2005: 234-245 - 2004
- [c12]James Laird:
A Game Semantics of Local Names and Good Variables. FoSSaCS 2004: 289-303 - [c11]James Laird:
A Calculus of Coroutines. ICALP 2004: 882-893 - 2003
- [c10]James Laird:
Bistability: An Extensional Characterization of Sequentiality. CSL 2003: 372-383 - [c9]James Laird:
A Game Semantics of Linearly Used Continuations. FoSSaCS 2003: 313-327 - [c8]James Laird:
A Fully Abstract Bidomain Model of Unary FPC. TLCA 2003: 211-225 - 2002
- [c7]James Laird:
Exceptions, Continuations and Macro-expressiveness. ESOP 2002: 133-146 - [c6]James Laird:
A Categorical Semantics of Higher Order Store. CTCS 2002: 209-226 - 2001
- [c5]James Laird:
A Fully Abstract Game Semantics of Local Exceptions. LICS 2001: 105-114 - [c4]James Laird:
A Deconstruction of Non-deterministic Classical Cut Elimination. TLCA 2001: 268-282 - [c3]James Laird:
A Game Semantics of Idealized CSP. MFPS 2001: 232-257 - 2000
- [c2]James Laird:
Finite Models and Full Completeness. CSL 2000: 384-398
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
