A domain-theoretic approach to statistical programming languages
From MaRDI portal
Cites work
- A Bayesian analysis of some nonparametric problems
- A Convenient Category for Higher-Order Probability Theory
- A faithful computational model of the real numbers
- A Note on the Generation of Random Normal Deviates
- A probabilistic and non-deterministic call-by-push-value language
- A probabilistic language based upon sampling functions
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- An Extension Result for Continuous Valuations
- Application ofComputable Distributions to the Semantics of Probabilistic Programs
- Bilinearity and Cartesian Closed Monads.
- Commutative monads as a theory of distributions
- Commutative monads for probabilistic programming languages
- Commutative semantics for probabilistic programming
- Completing simple valuations in K-categories
- Computability on the probability measures on the Borel sets of the unit interval
- Computer Science Logic
- Continuous Lattices and Domains
- CPO's of measures for nondeterminism
- D-completions and the \(d\)-topology
- Domain-complete and LCS-complete spaces
- Domain-Theoretic Foundations of Functional Programming
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Exact Bayesian inference by symbolic disintegration
- Extension of valuations on locally compact sober spaces
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Full abstraction for probabilistic PCF
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 193631 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 1222580 (Why is no real title available?)
- scientific article; zbMATH DE number 1231645 (Why is no real title available?)
- scientific article; zbMATH DE number 1350306 (Why is no real title available?)
- scientific article; zbMATH DE number 1107499 (Why is no real title available?)
- scientific article; zbMATH DE number 1531376 (Why is no real title available?)
- Integration in Real PCF
- Lazy algorithms for exact real arithmetic
- Measures, integrals and martingales
- Non-Hausdorff topology and domain theory. Selected topics in point-set topology
- Notions of computation and monads
- PCF extended with real numbers
- Probabilistic inference by program transformation in Hakaru (system description)
- Product Spaces in Locales
- Products and projective limits of continuous valuations on \(T_0\) spaces
- Quasi-Polish spaces
- Relational properties of domains
- Representing probability measures using probabilistic processes
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Semantics of a sequential language for exact real-number computation
- Separating minimal valuations, point-continuous valuations, and continuous valuations
- Spaces of maximal points
- Sull' integrazione per parti.
- The bounded-complete hull of an \(\alpha\)-space
- The generalized Riemann integral on locally compact spaces
- The geometry of Bayesian programming
- Von Neumann's Comparison Method for Random Sampling from the Normal and Other Distributions
- τ-smooth BOREL Measures on Topological Spaces
This page was built for publication: A domain-theoretic approach to statistical programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031983)
