10 citations · 17 across the 5 of their papers we have counts for
7 papers
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…
A Differential-form Pullback Programming Language for Higher-order Reverse-mode Automatic Differentiation
Carol Mak, Luke Ong
Building on the observation that reverse-mode automatic differentiation (AD) -- a generalisation of backpropagation -- can naturally be expressed as pullbacks of differential 1-for…
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…
Fixing Incremental Computation: Derivatives of Fixpoints, and the Recursive Semantics of Datalog
Mario Alvarez-Picallo, Alex Eyers-Taylor, Michael Peyton Jones +1
Incremental computation has recently been studied using the concepts of change structures and derivatives of programs, where the derivative of a function allows updating the output…
A Type System for proving Depth Boundedness in the pi-calculus
Emanuele D'Osualdo, Luke Ong
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragm…