48 citations · 174 across the 34 of their papers we have counts for
7 papers · 1 filter
Verifying Liveness Properties of ML Programs
M. M. Lester, R. P. Neatherway, C. -H. L. Ong +1
Higher-order recursion schemes are a higher-order analogue of Boolean Programs; they form a natural class of abstractions for functional programs. We present a new, efficient algor…
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…
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
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…
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Carol Mak, C. -H. Luke Ong, Hugo Paquet +1
We study the differential properties of higher-order statistical probabilistic programs with recursion and conditioning. Our starting point is an open problem posed by Hongseok Yan…