This program is tentative and subject to change.
We describe an exact sampler for a simply-typed, first-order functional programming language. Given an acyclic finite automaton, α∅, it samples a random function uniformly without replacement from well-typed functions in L(α∅). This is achieved via a fixed-parameter tractable reduction from a syntax-directed type system to a context-free grammar, preserving type soundness and completeness w.r.t. L(α∅), while retaining the robust metatheory of formal languages.
| Poster (lafi_poster.pdf) | 116KiB |
This program is tentative and subject to change.
Sun 11 JanDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
Sun 11 Jan
Displayed time zone: Brussels, Copenhagen, Madrid, Paris change
11:00 - 12:30 | |||
11:00 55mKeynote | A Welcome to Causal Probabilistic Programming LAFI | ||
11:56 10mTalk | Verifying Sampling Algorithms via Distributional Invariants LAFI Daniel Zilken , Tobias Winkler RWTH Aachen University, Kevin Batz RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University Media Attached File Attached | ||
12:08 10mTalk | Sequential Monte Carlo Program Synthesis with Refinement Proposals LAFI Maddy Bowers Massachusetts Institute of Technology, Mauricio Barba da Costa MIT, Xiaoyan Wang Massachusetts Institute of Technology, Joshua B. Tenenbaum Massachusetts Institute of Technology, Vikash Mansinghka Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology, Alexander K. Lew Yale University | ||
12:20 10mTalk | A Word Sampler for Well-Typed Functions LAFI Pre-print File Attached | ||
