Pages that link to "Item:Q2981999"

The following pages link to A lambda-calculus foundation for universal probabilistic programming (Q2981999):

Displaying 14 items.

• On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
• A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
• Correctness of sequential Monte Carlo inference for probabilistic programming languages (Q2233471) (← links)
• Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
• Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
• Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (Q2988648) (← links)
• Commutative Semantics for Probabilistic Programming (Q2988671) (← links)
• The geometry of Bayesian programming (Q5076392) (← links)
• (Q5079740) (← links)
• On the Taylor expansion of probabilistic λ-terms (Q5089013) (← links)
• (Q5089018) (← links)
• (Q5101335) (← links)
• Two decades of automatic amortized resource analysis (Q5875892) (← links)
• A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces (Q6145528) (← links)