13 citations · 24 across the 11 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2018★ 2 cited
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
Naoki Kobayashi, Ugo Dal Lago, Charles Grellois
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 probabili…
cs.PL2017★ 1 cited
Probabilistic Termination by Monadic Affine Sized Typing (Long Version)
Ugo Dal Lago, Charles Grellois
We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which term…