6 citations · 11 across the 5 of their papers we have counts for
6 papers
Revisiting Decidable Bounded Quantification, via Dinaturality
James Laird
We use a semantic interpretation to investigate the problem of defining an expressive but decidable type system with bounded quantification. Typechecking in the widely studied Syst…
Fraud detection in telephone conversations for financial services using linguistic features
Nikesh Bajaj, Tracy Goodluck Constance, Marvin Rajwadi +6
Detecting the elements of deception in a conversation is one of the most challenging problems for the AI community. It becomes even more difficult to design a transparent system, w…
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics
William John Gowers, James Laird
The non-commutative sequoid operator on games was introduced to capture algebraically the presence of state in history-sensitive strategies in game semantics, by imposing…
Combining and Relating Control Effects and their Semantics
James Laird
Combining local exceptions and first class continuations leads to programs with complex control flow, as well as the possibility of expressing powerful constructs such as resumable…
A Concrete Representation of Observational Equivalence for PCF
Martin Churchill, James Laird, Guy McCusker
The full abstraction result for PCF using game semantics requires one to identify all innocent strategies that are innocently indistinguishable. This involves a quantification over…
Bistable Biorders: A Sequential Domain Theory
James Laird
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the e…