A Verified Compiler for Probability Density Functions

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

• Tobias Nipkow, Institute of Informatics Technical Institute of Munich
• Thursday 24 July 2014, 10:00-11:00
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

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:

• All Talks (aka the CURE list)
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.