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 fullabstraction result for such a generic, coinductive methodology for program equivalence.
Ugo Dal, L., Gavazzo, F., Tanaka, R. (2017). Effectful applicative similarity for call-by-name lambda calculi. CEUR-WS.
Effectful applicative similarity for call-by-name lambda calculi
Lago, Ugo Dal
;Gavazzo, Francesco
;
2017
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 fullabstraction result for such a generic, coinductive methodology for program equivalence.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
