A type theory for probability density functions
DOI10.1145/2103656.2103721zbMATH Open1321.68164OpenAlexW4230647180MaRDI QIDQ2942901FDOQ2942901
Authors: Sooraj Bhat, Ashish Agarwal, Richard Vuduc, Alexander Gray 
Publication date: 11 September 2015
Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2103656.2103721
Recommendations
- Deriving probability density functions from probabilistic functional programs
- Deriving probability density functions from probabilistic functional programs
- Deriving a probability density calculator (functional pearl)
- A type theory for probabilistic and Bayesian reasoning
- An application of computable distributions to the semantics of probabilistic programming languages
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (11)
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Deriving probability density functions from probabilistic functional programs
- A Type Theory for Probabilistic $$\lambda $$–calculus
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Deriving probability density functions from probabilistic functional programs
- Pre-measure spaces and pre-integration spaces in predicative Bishop-Cheng measure theory
- Fabular: regression formulas as probabilistic programming
- Does a Program Yield the Right Distribution?
- Statistical properties of simple types
- Title not available (Why is that?)
- Towards probabilistic reasoning in type theory -- the intersection type case
This page was built for publication: A type theory for probability density functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942901)
