Decomposing probabilistic lambda calculi

DOI10.1007/978-3-030-45231-5_8OpenAlexW3021071762MaRDI QIDQ2200818

Ugo Dal Lago, Willem Heijltjes, Giulio Guerrieri

Publication date: 23 September 2020

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A rewriting approach to binary decision diagrams
• Environmental bisimulations for probabilistic higher-order languages
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
• A deterministic rewrite system for the probabilistic λ-calculus
• Stochastic lambda calculus and monads of probability distributions
• Parallel reductions in \(\lambda\)-calculus

This page was built for publication: Decomposing probabilistic lambda calculi