Jules Jacobs

julesjacobs@gmail.com

blog github twitter

I'm a PhD student of Robbert Krebbers at Radboud University studying formal verification and programming languages, and working on deadlock freedom in collaboration with Stephanie Balzer.

Some of my favourite things are: type theory, parametricity, SSA as a dataflow lattice, generating functions & Kirchoff's matrix-tree theorem, differential forms & the Gauss-Bonnet theorem, star semirings, Lagrangian mechanics.

Publications

POPL'21

Paradoxes of Probabilistic Programming
And How to Condition on Events of Measure Zero with Infinitesimal Probabilities

Jules Jacobs

pdf acm dl bibtex code slides video

Drafts & Notes

Dec. 2020	A simple proof of the matrix-tree theorem, upward routes, and a matrix-tree-cycle theorem Jules Jacobs pdf
Dec. 2020	Functional Evaluation Contexts An alternative way to handle evaluation contexts in proof assistants like Coq Jules Jacobs pdf code
Dec. 2020	Sorting Real Numbers, Constructively Jules Jacobs pdf
Dec. 2020	Binary Search a Little Simpler & More Generic Jules Jacobs pdf
Sep. 2020	A Magic Determinant Formula for Symmetric Polynomials of Eigenvalues Jules Jacobs pdf code

Talks

25 Nov. 2020	Paradoxes of Probabilistic Programming PL Seminar, TU Delft slides
23 Nov. 2020	Paradoxes of Probabilistic Programming PPLV, University College London slides
28 Oct. 2020	Paradoxes of Probabilistic Programming SWS Seminar, Radboud University

Teaching

2020	Assisting Robbert Krebbers with the supervision of a master thesis project.
2020	Assisted Robbert Krebbers with the Software Verification course at TU Delft.

Academic Service

2020	Reviewer for ESOP'21.
2020	Reviewer for ICFP'20.