Causal Probabilistic Programming via Magmadic Do-Notation
Mario Román
Abstract
We introduce a do-notation metalanguage for causal probabilistic programming. The metalanguage is based on magmads: non-associative monads. We derive causal probabilistic programming constructs from non-associativity and the primitives of probabilistic programming.
Create a lesson
Related papers
Unifying Function- and Argument-First Bidirectional Type Systems
Takuma Yoshioka, Taro Sekiyama, Atsushi Igarashi
Synthesis of Compact and Expressive Quantum-Circuit Optimizations
Wei Qiang, Ronghui Gu
Support Local Variables
Maxwell Bernstein, Takashi Kokubun, Aaron Patterson et al.
Relational Task Generation Language: A Declarative Specification Framework for Relational Deep Learning
Oleksii Kolesnichenko, Jakub Peleška, Gustav Š\'ır
Griotte: Verified Compartmentalisation via Capabilities
June Rousseau, Aïna Linn Georges, Jean Pichon-Pharabod et al.
A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs
Alex Rice, Chris Heunen, Tobias Grosser