Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl)
2026-07-24T08:52:03Z•5ff95d310194d6bed43776f3a92df0857a042d6084ee0b7eafd2d4f65a0cdd27
BDDCHRCaVEDSLHaskellMaudeSMTcausal-inferenceformal-verificationglobal-typesgrassroots-platformsintegrity-constraintslivenesslogic-programmingminiKanrenmodel-checkingmultiagent-systemsmultipartynarrowingprobabilistic-logic-programming (PLP)probabilistic-programmingreal-time-systemssession-typestype-theoryweighted-model-counting
What happened
Collection of recent programming-languages and formal-methods papers (arXiv 24 Jul 2026) covering: Imprecise probabilistic programming via BDDs and semiring-parametric weighted model counting with a Haskell DSL (Imp); GLP, a concurrent multiagent logic programming language for grassroots platforms; chrKanren, adding Constraint Handling Rules to miniKanren; CaVE, a constraint-storage design for integrity constraints in stableKanren; a proof and toolchain showing top-down and bottom-up multiparty session-type approaches give equivalent typability and liveness via a principal global type; a пози́
Why it matters
A reviewed impact interpretation has not been published for this record.
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.