Cubical Agda formalization of conditional independence as paths, Bayesian conditioning, and soundness of Pearl's d-separation on arbitrary finite DAGs, plus a minimal generalization of the convex-algebra interchange axiom.
Modelling recursion and probabilistic choice in guarded type theory.Proc
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.
citing papers explorer
-
A cubical formalisation of conditional independence, Bayesian conditioning, and Pearl's d-separation soundness
Cubical Agda formalization of conditional independence as paths, Bayesian conditioning, and soundness of Pearl's d-separation on arbitrary finite DAGs, plus a minimal generalization of the convex-algebra interchange axiom.
-
Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams
Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.