A Type Theory for Probabilistic $$\lambda $$–calculus
From MaRDI portal
Publication:3297838
DOI10.1007/978-3-030-41103-9_3zbMath1440.68043OpenAlexW3005912220MaRDI QIDQ3297838
Publication date: 20 July 2020
Published in: From Lambda Calculus to Cybersecurity Through Program Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-41103-9_3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- LCF considered as a programming language
- A calculus for overloaded functions with subtyping
- Intersection and union types: Syntax and semantics
- Probabilistic operational semantics for the lambda calculus
- Semantics of the Probabilistic Typed Lambda Calculus
- Probabilistic -calculus and Quantitative Program Analysis
- Functional Characters of Solvable Terms
- Introduction to generalized type systems
- Stochastic lambda calculus and monads of probability distributions
- A probabilistic language based upon sampling functions