Stochastic lambda calculus and monads of probability distributions
From MaRDI portal
Publication:5178903
DOI10.1145/503272.503288zbMath1323.68150OpenAlexW2050509196MaRDI QIDQ5178903
Publication date: 17 March 2015
Published in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/503272.503288
Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ Probabilistic modelling, inference and learning using logical theories ⋮ Probabilistic operational semantics for the lambda calculus ⋮ The expectation monad in quantum foundations ⋮ Probabilistic reasoning in a classical logic ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Decomposing probabilistic lambda calculi ⋮ Proofs of randomized algorithms in Coq ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring ⋮ Commutative Semantics for Probabilistic Programming ⋮ A Type Theory for Probabilistic $$\lambda $$–calculus ⋮ Computable Exchangeable Sequences Have Computable de Finetti Measures ⋮ A Calculus for Game-Based Security Proofs ⋮ Unnamed Item ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Unnamed Item ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Probabilistic Inference by Program Transformation in Hakaru (System Description) ⋮ An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages ⋮ Measure Transformer Semantics for Bayesian Machine Learning ⋮ Categories of Timed Stochastic Relations ⋮ The Computational SLR: A Logic for Reasoning about Computational Indistinguishability ⋮ Computable de Finetti measures ⋮ Unnamed Item ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work ⋮ Probabilistic π-Calculus and Event Structures
