Pages that link to "Item:Q3297838"
From MaRDI portal
The following pages link to A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838):
Displaying 8 items.
- Probabilistic reasoning about simply typed lambda terms (Q1709701) (← links)
- Towards probabilistic reasoning in type theory -- the intersection type case (Q2206780) (← links)
- Towards a structural proof theory of probabilistic \(\mu\)-calculi (Q2289094) (← links)
- Probabilistic approach to the lambda definability for fourth order types (Q2851692) (← links)
- A lambda-calculus foundation for universal probabilistic programming (Q2981999) (← links)
- (Q3384059) (← links)
- Synthetic topology in Homotopy Type Theory for probabilistic programming (Q5055499) (← links)
- A possible worlds semantics for trustworthy non-deterministic computations (Q6596679) (← links)