Skip to Main content Skip to Navigation
Journal articles

Effectful applicative similarity for call-by-name lambda calculi

Ugo Dal Lago 1, 2 Francesco Gavazzo 3, 2 Ryo Tanaka 4
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Francesco Gavazzo Connect in order to contact the contributor
Submitted on : Friday, November 6, 2020 - 10:04:01 AM
Last modification on : Monday, May 17, 2021 - 12:00:05 PM
Long-term archiving on: : Sunday, February 7, 2021 - 6:26:18 PM


Files produced by the author(s)




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



Record views


Files downloads