On continuation-passing transformations and expected cost analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Proceedings of the ACM on Programming Languages Year : 2021

On continuation-passing transformations and expected cost analysis

Abstract

We define a continuation-passing style (CPS) translation for a typed-calculus with probabilistic choice, unbounded recursion, and a tick operator-for modeling cost. The target language is a (non-probabilistic)-calculus, enriched with a type of extended positive reals and a fixpoint operator. We then show that applying the CPS transform of an expression to the continuation .0 yields the expected cost of. We also introduce a formal system for higher-order logic, called EHOL, prove it sound, and show it can derive tight upper bounds on the expected cost of classic examples, including Coupon Collector and Random Walk. Moreover, we relate our translation to Kaminski et al. 's ert-calculus, showing that the latter can be recovered by applying our CPS translation to (a generalization of) the classic embedding of imperative programs into-calculus. Finally, we prove that the CPS transform of an expression can also be used to compute pre-expectations and to reason about almost sure termination.
Fichier principal
Vignette du fichier
paper.pdf (744.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03338493 , version 1 (08-09-2021)

Identifiers

Cite

Martin Avanzini, Gilles Barthe, Ugo Dal Lago. On continuation-passing transformations and expected cost analysis. Proceedings of the ACM on Programming Languages, 2021, 5 (ICFP), pp.1 - 30. ⟨10.1145/3473592⟩. ⟨hal-03338493⟩
37 View
55 Download

Altmetric

Share

Gmail Facebook X LinkedIn More