Author Archives: wand

Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

We present a complete reasoning principle for contextual equivalence in an untyped probabilistic programming language. The language includes continuous random variables, conditionals, and scoring. The language also includes recursion, since in an untyped language the standard call-by-value fixpoint combinator is expressible. The language is similar … Continue reading

Posted in Uncategorized | Comments Off on Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion