Author Archives: Daniel Huang

An Application of Computable Distributions to the Semantics of Probabilistic Programs: Part 2

We continue our previous work [5] on giving semantics to probabilistic programs using computable distributions. First, we highlight a gap in our previous semantics involving the measurability of an environment lookup function and address it. Second, we suggest topological domains, a category of domains proposed in the literature that supports both Type-2 computability and domain-theoretic constructions, as an alternative to DCPOs in giving semantics to probabilistic programs based on computable distributions.

 

Extended Abstract:

comp-dist-sem

 

[5] D. Huang and G. Morrisett. An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages. In Programming Languages and Systems, pages 337–363. Springer, 2016.

Posted in Uncategorized | Leave a comment