Lambda calculus and probabilistic computation

DOI10.5555/3470152.3470186MaRDI QIDQ6654500zbMATH OpenFDO

Authors Claudia Faggian, Simona Ronchi Della Rocca

Publication date 19 December 2024

Full work available at URL https://doi.org/10.5555/3470152.3470186

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

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

Cited in

(12)

• Decomposing probabilistic lambda calculi
• Fully abstract models of the probabilistic -calculus
• The sub-additives: a proof theory for probabilistic choice extending linear logic
• The discriminating power of the let-in operator in the lazy call-by-name probabilistic \(\lambda\)-calculus
• Curry and Howard meet Borel
• Factorize factorization
• Solvability in a probabilistic setting (invited talk)
• Mirroring call-by-need, or values acting silly
• A quantitative approach to global state composition
• Simple types for probabilistic termination
• A rewriting theory for quantum -calculus
• Mirroring call-by-need, or values acting silly

This page was built for publication: Lambda calculus and probabilistic computation

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