Monads for measurable queries in probabilistic databases
From MaRDI portal
Publication:6653746
DOI10.4204/eptcs.351.3MaRDI QIDQ6653746
Publication date: 17 December 2024
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notions of computation and monads
- Borel structures for function spaces
- Probabilistic (logic) programming concepts
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Open-world probabilistic databases: semantics, algorithms, complexity
- The general theory of stochastic population processes
- Axioms for probability and nondeterminism
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- The coincidence approach to stochastic point processes
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- Combining probabilistic and non-deterministic choice via weak distributive laws
- Distributing probability over non-determinism
- Infinite Probabilistic Databases
- Multinomial and hypergeometric distributions in Markov categories
Related Items (1)
This page was built for publication: Monads for measurable queries in probabilistic databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653746)
