64 citations · 74 across the 2 of their papers we have counts for
3 papers
cs.PL2017★ 64 cited
Denotational validation of higher-order Bayesian inference
Adam Ścibior, Ohad Kammar, Matthijs Vákár +7
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inferenc…
cs.LO2017★ 10 cited
In Search of Effectful Dependent Types
Matthijs Vákár
Real world programming languages crucially depend on the availability of computational effects to achieve programming convenience and expressive power as well as program efficiency…
cs.PL2016
An Effectful Treatment of Dependent Types
Matthijs Vákár
We extend Levy's call-by-push-value (CBPV) analysis from simple to dependent type theory (DTT) in order to study the interaction between computational effects and dependent types.…