activity
20182026
most citedOn Probabilistic Termination of Functional Programs with Continuous Distributions

12 citations · 20 across the 7 of their papers we have counts for

collaborators

7 papers

cs.CL2026

FaithformBench: Benchmarking Faithfulness of Mathematical Chain-of-Thought Autoformalisation

Rob Cornish, Iacopo Ghinassi, Po-Hung Yeh +7

Autoformalisation (AF) systems map natural language reasoning steps into formal statements in a proof assistant such as Lean. We consider how to assess the faithfulness of these sy…

cs.SE2026

AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language

Qiyuan Xu, Joshua Ong Jun Leang, Renxi Wang +4

Interactive theorem proving (ITP) underpins program verification and formalized mathematics, but its manual effort limits scalability. LLM-based proof agents promise to ease this e…

cs.LG2025

SB-TRPO: Towards Safe Reinforcement Learning with Hard Constraints

Dominik Wagner, Ankit Kanwar, Luke Ong

In safety-critical domains, reinforcement learning (RL) systems must satisfy strict, zero-cost safety constraints while achieving meaningful task performance. Existing model-free m…

cs.AI2025

Near-Optimal Reinforcement Learning for Constrained Recurrence Objectives

Dominik Wagner, Leon Witzman, Luke Ong

Recurrence objectives, where a target region must be visited infinitely often, are a fundamental class of specifications for Markov decision processes (MDPs) and form the core of $…

cs.PL2023★ 1 cited

Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach

Fabian Zaiser, Andrzej S. Murawski, Luke Ong

We present an exact Bayesian inference method for discrete statistical models, which can find exact solutions to a large class of discrete inference problems, even with infinite su…

cs.PL2021★ 12 cited

On Probabilistic Termination of Functional Programs with Continuous Distributions

Raven Beutner, Luke Ong

We study termination of higher-order probabilistic functional programs with recursion, stochastic conditioning and sampling from continuous distributions. Reasoning about the termi…

math.PR2018★ 7 cited

On S-Finite Measures and Kernels

Matthijs Vákár, Luke Ong

In this note, we develop some of the basic theory of s-finite (measures and) kernels, a little-studied class that Staton has recently argued convincingly to be precisely the semant…