Pages that link to "Item:Q1675793"
From MaRDI portal
The following pages link to A probabilistic semantics for the pure \(\lambda\)-calculus (Q1675793):
Displaying 14 items.
- Probabilistic reasoning about simply typed lambda terms (Q1709701) (← links)
- Stochastic \(\lambda\)-calculi: an extended abstract (Q2250553) (← links)
- Towards a structural proof theory of probabilistic \(\mu\)-calculi (Q2289094) (← links)
- An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages (Q2802487) (← links)
- \(\lambda\)-calculus and quantitative program analysis (extended abstract) (Q2849843) (← links)
- Probabilistic approach to the lambda definability for fourth order types (Q2851692) (← links)
- On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus (Q2888508) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- A lambda-calculus foundation for universal probabilistic programming (Q2981999) (← links)
- Probabilistic -calculus and Quantitative Program Analysis (Q3025332) (← links)
- A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838) (← links)
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers (Q4603430) (← links)
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus (Q5145645) (← links)
- Stochastic lambda calculus and monads of probability distributions (Q5178903) (← links)
