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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 16, Issue 4
Main Authors:	Kobayashi, Naoki, Lago, Ugo Dal, Grellois, Charles
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 02.10.2020 Logical Methods in Computer Science e.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!