Metric Reasoning About λ-Terms: The General Case - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Metric Reasoning About λ-Terms: The General Case


In any setting in which observable properties have a quantitative flavor, it is natural to compare computational objects by way of metrics rather than equivalences or partial orders. This holds, in particular , for probabilistic higher-order programs. A natural notion of comparison , then, becomes context distance, the metric analogue of Morris' context equivalence. In this paper, we analyze the main properties of the context distance in fully-fledged probabilistic λ-calculi, this way going beyond the state of the art, in which only affine calculi were considered. We first of all study to which extent the context distance trivializes, giving a sufficient condition for trivialization. We then characterize context distance by way of a coinductively-defined, tuple-based notion of distance in one of those calculi, called Λ ⊕ !. We finally derive pseudomet-rics for call-by-name and call-by-value probabilistic λ-calculi, and prove them fully-abstract.
Fichier principal
Vignette du fichier
main.pdf (562.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01639369 , version 1 (20-11-2017)



Raphaëlle Crubillé, Ugo Dal Lago. Metric Reasoning About λ-Terms: The General Case. ESOP 2017 - 26th European Symposium on Programming, Apr 2017, Uppsala, Sweden. pp.341-367, ⟨10.1007/978-3-662-54434-1_13⟩. ⟨hal-01639369⟩
303 View
138 Download



Gmail Facebook X LinkedIn More