Interpreting lambda calculus in domain-valued random variables
From MaRDI portal
Cites work
- A category theoretic formulation for Engeler-style models of the untyped -calculus
- A category-theoretic approach to Boolean-valued models of set theory
- A Convenient Category for Higher-Order Probability Theory
- A lambda-calculus foundation for universal probabilistic programming
- A proof of the independence of the continuum hypothesis
- Algebras and combinators
- Boolean valued analysis. Transl. from the Russian
- Boolean-valued semantics for the stochastic \(\lambda \)-calculus
- Continuous Lattices and Domains
- scientific article; zbMATH DE number 2184445 (Why is no real title available?)
- scientific article; zbMATH DE number 3645093 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- Measure theory. Vol. 3. Measure algebras
- Measure-theoretic construction of incomparable hyperdegrees
- On the computability of conditional probability
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Quantitative Algebraic Reasoning
- Quasitopoi, logic and Heyting-valued models
- Recursively enumerable sets and degrees. A study of computable functions and computably generated sets
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Set theory.
- Stochastic \(\lambda\)-calculi: an extended abstract
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The upper semi-lattice of degrees of recursive unsolvability
This page was built for publication: Interpreting lambda calculus in domain-valued random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445710)