On the Termination Problem for Probabilistic Higher-Order Recursive Programs

In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study o...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Logical methods in computer science Ročník 16, Issue 4
Hlavní autori:	Kobayashi, Naoki, Lago, Ugo Dal, Grellois, Charles
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 02.10.2020 Logical Methods in Computer Science e.V
Predmet:	Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science model checking probabilistic programs higher-order programs termination probabilities
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!