A lambda-calculus foundation for universal probabilistic programming

DOI10.1145/2951913.2951942zbMath1360.68314arXiv1512.08990OpenAlexW2206718322WikidataQ130968192 ScholiaQ130968192MaRDI QIDQ2981999

Ugo Dal Lago, Marcin Szymczak, Andrew D. Gordon, Johannes Borgström

Publication date: 10 May 2017

Published in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.08990

zbMATH Keywords

operational semanticsmachine learninglambda-calculusMCMCprobabilistic programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (14)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ The geometry of Bayesian programming ⋮ A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces ⋮ Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring ⋮ Commutative Semantics for Probabilistic Programming ⋮ Correctness of sequential Monte Carlo inference for probabilistic programming languages ⋮ Densities of almost surely terminating probabilistic programs are differentiable almost everywhere ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Taylor expansion of probabilistic λ-terms ⋮ Two decades of automatic amortized resource analysis

This page was built for publication: A lambda-calculus foundation for universal probabilistic programming