A Domain-theoretic Approach to Statistical Programming Languages
Abstract
References
Index Terms
- A Domain-theoretic Approach to Statistical Programming Languages
Recommendations
A domain theory for statistical probabilistic programming
We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in computational ...
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions
Alex Simpson has suggested to use an observationally-induced approach towards modelling computational effects in denotational semantics. The principal idea is that a single observation algebra is used for defining the computational type structure. He ...
A Set-Theoretic Representation of Algebraic L-domains
Theory and Applications of Models of ComputationAbstractIn this paper, we aim to establish a concrete representation, as a family of sets, for every algebraic L-domain. We generalize the notion of a topped algebraic intersection structure to a locally algebraic intersection structure. Just as topped ...
Comments
Information & Contributors
Information
Published In
![cover image Journal of the ACM](/cms/asset/ef821f03-ab69-47ba-8ee9-60c554afdab7/3627674.cover.jpg)
- Editor:
- Venkatesan Guruswami
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSFC
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 477Total Downloads
- Downloads (Last 12 months)477
- Downloads (Last 6 weeks)18
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in