A Type Theory for Probabilistic and Bayesian Reasoning
Logic in Computer Science
2025-04-02 v1 Logic
Probability
Abstract
This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes our probabilistic type theory from quantum type theory, namely the bijective correspondence between predicates and side-effect free actions (called instrument, or assert, maps). The paper shows how suitable computation rules can be derived from this predicate-action correspondence, and uses these rules for calculating conditional probabilities in two well-known examples of Bayesian reasoning in (graphical) models. Our type theory may thus form the basis for a mechanisation of Bayesian inference.
Cite
@article{arxiv.1511.09230,
title = {A Type Theory for Probabilistic and Bayesian Reasoning},
author = {Robin Adams and Bart Jacobs},
journal= {arXiv preprint arXiv:1511.09230},
year = {2025}
}
Comments
38 pages