Universal Semantics for the Stochastic Lambda-Calculus

2020/11/26 by Amorim, Pedro, Kozen, Dexter, Mardare, Radu +2 · 1 citation
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2011.13171

Abstract

We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs, but for the first time admit an adequacy theorem relating the operational and denotational views. This resolves the main issue left open in (Bacci et al. 2018).

Cited by

• Trustworthiness Preservation by Copies of Machine Learning Systems

Related

• Probabilistic Operational Semantics for the Lambda Calculus
• A Lambda-Calculus Foundation for Universal Probabilistic Programming
• A Higher-Order Language for Markov Kernels and Linear Operators
• Decomposing Probabilistic Lambda-calculi
• Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case