11 citations · 11 across the 1 of their papers we have counts for
3 papers
cs.PL2017
Bonsai: Synthesis-Based Reasoning for Type Systems
Kartik Chandra, Rastislav Bodik
We describe algorithms for symbolic reasoning about executable models of type systems, supporting three queries intended for designers of type systems. First, we check for type sou…
cs.AI2016★ 11 cited
Swift: Compiled Inference for Probabilistic Programming Languages
Yi Wu, Lei Li, Stuart Russell +1
A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilit…
cs.PL2016
SIMPL: A DSL for Automatic Specialization of Inference Algorithms
Rohin Shah, Emina Torlak, Rastislav Bodik
Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a quer…