University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > A Verified Compiler for Probability Density Functions

A Verified Compiler for Probability Density Functions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Bhat, Borgström, Gordon and Russo recently published a compiler from a small probabilistic functional programming language to probability density functions. That is, the input is a functional program that generates random values according to some distribution. The compiler translates the program into its probability density function (if it exists). In this talk we present a formalization of this work in the interactive theorem prover Isabelle/HOL, including a verification of the compiler.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity