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.
Effectful applicative similarity for call-by-name lambda calculi
Gavazzo F.;
2020
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
TCS_2020 (1).pdf
accesso aperto
Tipologia:
Preprint (AM - Author's Manuscript - submitted)
Licenza:
Accesso libero
Dimensione
524 kB
Formato
Adobe PDF
|
524 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
