A functional account of probabilistic programming with possible worlds. Declarative pearl
From MaRDI portal
Publication:2163171
DOI10.1007/978-3-030-99461-7_11OpenAlexW4285136686MaRDI QIDQ2163171
Birthe van den Berg, Tom Schrijvers
Publication date: 10 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-99461-7_11
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Haskell
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Dsharp
- The independent choice logic for modelling multiple agents under uncertainty
- Probabilistic Inference by Program Transformation in Hakaru (System Description)
- Backtracking, interleaving, and terminating monad transformers
- Datafun: a functional Datalog
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- Estimating 3-D location parameters using dual number quaternions
- Unifying Theories of Programming with Monads
- Handlers of Algebraic Effects
- Algebras for combinatorial search
- The well-founded semantics for general logic programs
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism
- Stochastic lambda calculus and monads of probability distributions
- Logic Programming
- A simple automatic derivative evaluation program
- Backtracking with cut via a distributive law and left-zero monoids
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Some Notes on Proofs with Alpha Graphs
This page was built for publication: A functional account of probabilistic programming with possible worlds. Declarative pearl
