A probabilistic language based upon sampling functions
From MaRDI portal
Recommendations
- An application of computable distributions to the semantics of probabilistic programming languages
- A lambda-calculus foundation for universal probabilistic programming
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Probabilistic logic programming for hybrid relational domains
- Probabilistic (logic) programming concepts
Cited in
(17)- On bisimilarity in lambda calculi with continuous probabilistic choice
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Probabilistic reasoning in a classical logic
- An application of computable distributions to the semantics of probabilistic programming languages
- Probabilistic operational semantics for the lambda calculus
- A Type Theory for Probabilistic \lambda –calculus
- scientific article; zbMATH DE number 7015236 (Why is no real title available?)
- Probabilistic rewriting: normalization, termination, and unique normal forms
- Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
- Automation of quantitative information-flow analysis
- Measure transformer semantics for Bayesian machine learning
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- A domain-theoretic approach to statistical programming languages
- A logic of knowledge and justifications, with an application to computational trust
- Probabilistic modelling, inference and learning using logical theories
- Proofs of randomized algorithms in Coq
- Formalization of the standard uniform random variable
This page was built for publication: A probabilistic language based upon sampling functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276144)
