53 citations · 154 across the 20 of their papers we have counts for
Showing 2018Show 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.LO2018★ 5 cited
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya +1
It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-t…