Decomposing probabilistic lambda calculi

DOI10.1007/978-3-030-45231-5_8MaRDI QIDQ2200818zbMATH OpenOpenAlexFDO

Authors Ugo Dal Lago, Giulio Guerrieri, Willem Heijltjes

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Lambda calculus and probabilistic computation
• Probabilistic operational semantics for the lambda calculus
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• A probabilistic semantics for the pure \(\lambda\)-calculus
• Probabilistic  -calculus and Quantitative Program Analysis

Cites work

• scientific article; zbMATH DE number 3615887 (Why is no real title available?)
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• A rewriting approach to binary decision diagrams
• Environmental bisimulations for probabilistic higher-order languages
• Parallel reductions in \(\lambda\)-calculus
• Stochastic lambda calculus and monads of probability distributions
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees

Cited in

(5)

• Towards logical foundations for probabilistic computation
• A lambda-calculus foundation for universal probabilistic programming
• Curry and Howard meet Borel
• Lambda calculus and probabilistic computation
• A note on confluence in typed probabilistic lambda calculi

This page was built for publication: Decomposing probabilistic lambda calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200818)