Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory
ACM Transactions on Probabilistic Machine Learning · 2025
DOI: 10.1145/3732291 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Probabilistic Machine Learning, 2025. Verfasst von Reynald Affeldt und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: JSPS Kakenhi.
Abstract (Originalsprache)
Probabilistic programming languages are used to write probabilistic models to make probabilistic inferences. A number of rigorous semantics have been developed to reason about transformations of probabilistic programs and their execution. We propose to investigate the formalization of such a semantics to allow for the formal verification of probabilistic programs. Concretely, we extend an existing formalization of measure and integration theory in the Rocq prover, a proof assistant based on dependent type theory, with s-finite kernels, a mathematical structure to interpret typing judgments in the semantics of a probabilistic programming language. We explain the issues raised by organizing kernels as a hierarchy of mathematical structures and use the latter to formalize the semantics of a first-order probabilistic programming language. We use this semantics to establish generic properties of this language, prove rewriting laws to perform symbolic evaluation, and reason about iteration.
Förderung
- JSPS Kakenhi
Zitieren
APA
Affeldt, R., Cohen, C., & Saito, A. (2025). Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory. ACM Transactions on Probabilistic Machine Learning. https://doi.org/10.1145/3732291
Vancouver
Affeldt R, Cohen C, Saito A. Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory. ACM Transactions on Probabilistic Machine Learning. 2025. doi:10.1145/3732291
BibTeX
@article{Affeldt2025,
author = {Affeldt, Reynald and Cohen, Cyril and Saito, Ayumu},
title = {Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory},
journal = {ACM Transactions on Probabilistic Machine Learning},
year = {2025},
doi = {10.1145/3732291}
}
EUVIMED