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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

A Verified Compiler for Probability Density Functions

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom Alison Richards Building, 7 West Road (Sidgwick Site), Room: S1 Maxwell Theatre, PPSIS

Other talks

Title to be confirmed Beyond Hubble: Studying the Earliest Galaxies with the James Webb Space Telescope Group Work Carrollian momenta from anti de Sitter Chiral Lattice gauge theories from symmetry disentanglers Complete and Submit Project Choice Forms
 

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