Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl)
arXiv 2607.20801•5ff95d310194d6bed43776f3a92df0857a042d6084ee0b7eafd2d4f65a0cdd27
BDDCHRCaVEDSLHaskellMaudeSMTcausal-inferenceformal-verificationglobal-typesgrassroots-platformsintegrity-constraintslivenesslogic-programmingminiKanrenmodel-checkingmultiagent-systemsmultipartynarrowingprobabilistic-logic-programming (PLP)probabilistic-programmingreal-time-systemssession-typestype-theoryweighted-model-counting
Paper metadata
- arXiv ID
- 2607.20801
- Version
- Not specified by this published record
- Category
- Computer Science — Programming Languages (cs.PL)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 5ff95d310194d6bed43776f3a92df0857a042d6084ee0b7eafd2d4f65a0cdd27
- Enrichment time
- 2026-07-24T08:52:03Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.