no code implementations • 22 Feb 2021 • Andrew Kenyon-Roberts, Luke Ong
We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales.
Programming Languages Logic in Computer Science F.3.2
