Stochastic lambda calculus and monads of probability distributions

DOI10.1145/503272.503288zbMath1323.68150MaRDI QIDQ5178903

Norman Ramsey, Avi Pfeffer

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

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Unnamed Item, A Calculus for Game-Based Security Proofs, Effect polymorphism in higher-order logic (proof pearl), Effect polymorphism in higher-order logic (proof pearl), Measure Transformer Semantics for Bayesian Machine Learning, The expectation monad in quantum foundations, Computable de Finetti measures, Probabilistic modelling, inference and learning using logical theories, Proofs of randomized algorithms in Coq, CryptHOL: game-based proofs in higher-order logic, Decomposing probabilistic lambda calculi, Formal security proofs with minimal fuss: implicit computational complexity at work, Probabilistic reasoning in a classical logic, Probabilistic Inference by Program Transformation in Hakaru (System Description), An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages, Categories of Timed Stochastic Relations, Probabilistic π-Calculus and Event Structures, Probabilistic operational semantics for the lambda calculus, 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, On Applicative Similarity, Sequentiality, and Full Abstraction, Computable Exchangeable Sequences Have Computable de Finetti Measures, The Computational SLR: A Logic for Reasoning about Computational Indistinguishability