Termination and semantics of probabilistic lambda calculus
<p>This thesis gives a complete method for proving the almost sure termination of probabilistic programs, in a simply-typed higher-order language with continuous random variables and an explicit recursion construct. The method is based on supermartingales and ranking functions, which are a pro...
| Автор: | |
|---|---|
| Інші автори: | |
| Формат: | Дисертація |
| Мова: | English |
| Опубліковано: |
2024
|
| Предмети: |