An Intrinsically-typed Probabilistic Programming Language in Coq - Extended Abstract
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a conference talk on formalizing a probabilistic programming language using the Coq proof assistant. Delve into the use of intrinsically-typed syntax and dependent types for semantic values in this formalization effort. Learn about the application of Coq's features to simplify notation in concrete examples and enable equational reasoning for probabilistic programs. Discover how this work contributes to ongoing formal verification experiments in security proofs and artificial intelligence, supporting the diverse features of probabilistic programming.
Syllabus
[TyDe'23] An Intrinsically-typed Probabilistic Programming Language in Coq (Extended Abstr...
Taught by
ACM SIGPLAN
Related Courses
Introduction to programming with dependent types in ScalaStepik On Voevodsky's Univalence Principle - André Joyal
Institute for Advanced Study via YouTube Univalent Foundations and the Equivalence Principle - Benedikt Ahrens
Institute for Advanced Study via YouTube A Little Taste of Dependent Types
Strange Loop Conference via YouTube Dependent Types in Haskell
Strange Loop Conference via YouTube