Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics

DOI10.1007/978-3-642-55198-7zbMATH Open1439.03005OpenAlexW2593681380MaRDI QIDQ2970754FDOQ2970754

Authors: Dirk Draheim 

Publication date: 30 March 2017

Full work available at URL: https://doi.org/10.1007/978-3-642-55198-7

Recommendations

• Semantics of probabilistic processes. An operational approach
• A probabilistic semantics for the pure \(\lambda\)-calculus
• Foundations of probabilistic programming
• Abstraction, Refinement and Proof for Probabilistic Systems
• Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Cited In (3)

• A Type Theory for Probabilistic $$\lambda $$–calculus
• Fine-grained semantics for probabilistic programs
• Semantics of probabilistic processes. An operational approach

This page was built for publication: Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics

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