10 citations · 17 across the 7 of their papers we have counts for
6 papers · 1 filter
Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
Andrew Kenyon-Roberts, Luke Ong
We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingale…
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…
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…
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…
Defunctionalization of Higher-Order Constrained Horn Clauses
Long Pham, Steven J. Ramsay, C. -H. Luke Ong
Building on the successes of satisfiability modulo theories (SMT), Bjørner et al. initiated a research programme advocating Horn constraints as a suitable basis for automatic progr…
Information Flow Analysis for a Dynamically Typed Functional Language with Staged Metaprogramming
Martin Lester, Luke Ong, Max Schaefer
Web applications written in JavaScript are regularly used for dealing with sensitive or personal data. Consequently, reasoning about their security properties has become an importa…