Effectful applicative similarity for call-by-name lambda calculi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2020

Effectful applicative similarity for call-by-name lambda calculi

Abstract

We introduce a notion of applicative similarity in which not terms but monadic values arising from the evaluation of effectful terms, can be compared. We prove this notion to be fully abstract whenever terms are evaluated in call-by-name order. This is the first full-abstraction result for such a generic, coinductive methodology for program equivalence.
Fichier principal
Vignette du fichier
mainExtended.pdf (486.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02991694 , version 1 (06-11-2020)

Identifiers

Cite

Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka. Effectful applicative similarity for call-by-name lambda calculi. Theoretical Computer Science, 2020, 813, pp.234-247. ⟨10.1016/j.tcs.2019.12.025⟩. ⟨hal-02991694⟩
23 View
119 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More