10 citations · 17 across the 7 of their papers we have counts for
7 papers · 1 filter
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
Toby Cathcart Burn, Luke Ong, Steven Ramsay +1
We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation…
The Difference Lambda-Calculus: A Language for Difference Categories
Mario Alvarez-Picallo, C. -H. Luke Ong
Cartesian difference categories are a recent generalisation of Cartesian differential categories which introduce a notion of "infinitesimal" arrows satisfying an analogue of the Ko…
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
Christopher H. Broadbent, Arnaud Carayol, C. -H. Luke Ong +1
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic…
The Extended Theory of Trees and Algebraic (Co)datatypes
Fabian Zaiser, C. -H. Luke Ong
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Frühwirth, we co…
Polynomial Probabilistic Invariants and the Optional Stopping Theorem
Anne Schreuder, C. -H. Luke Ong
In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariant…
Change Actions: Models of Generalised Differentiation
Mario Alvarez-Picallo, C. -H. Luke Ong
Cai et al. have recently proposed change structures as a semantic framework for incremental computation. We generalise change structures to arbitrary cartesian categories and propo…