skip to content

Synthetic topology in Homotopy Type Theory for probabilistic programming

Presented by: 
Bas Spitters Aarhus Universitet
Monday 3rd July 2017 - 11:00 to 12:00
INI Seminar Room 2
The ALEA Coq library formalizes discrete measure theory using a variant of the Giry monad, as a submonad of the CPS monad: (A → [0, 1]) → [0, 1]. This allows to use Moggi’s monadic meta- language to give an interpretation of a language, Rml, into type theory. Rml is a functional language with a primitive for probabilistic choice. This formalization was the basis for the      Certicrypt system for verifying security protocols. Easycrypt is still based on the same idea. We improve on the formalization by using homotopy type theory which provides e.g. quotients and functional extensionality. Moreover, homotopy type theory allows us to use synthetic topology to present a theory which also  includes continuous data types, like [0, 1]. Such data types are relevant, for instance, in machine learning and differential privacy.  We indicate how our axioms are justified by  Kleene-Vesley realizability, a standard model for computation with continuous data types. (Joint work with Florian Faissole.)

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons