(External) Review Committee at PLDI 2019
Serve as a member of the external review committee at PLDI 2019.
Paper at PLDI 2018
Paper about automatically deriving bound on the expected value of resource usage for probabilistic programs at PLDI 2018.
An Example of Probabilistic Programming
A recursive implementation of a problem in foundation of computer science (trapped miner) as a probabilistic program in OCaml.
A Biased Random Walk in OCaml
A recursive implementation of a biased random walk in OCaml.
The Smallest Free Number
Pearls of Functional Algorithm Design - The Smallest Free Number
Expected Bounds - Resource Analysis for Probabilistic Programs
Expected Bounds - Resource Analysis for Probabilistic Programs.