(Not So) Boring Abstract Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

(Not So) Boring Abstract Machines

Abstract

We study one of the two formulations of the interaction abstract machine, namely that obtained from the so-called call-by-value (or “boring”) translation of intuitionistic logic into linear logic. We prove the correctness of the resulting call-by-name machine, at the same time establishing an improvement bisimulation with Krivine’s abstract machine. The proof makes essential use of the definition of a novel relational property linking configurations of the two machines.
Fichier principal
Vignette du fichier
ictcs2023.pdf (1.21 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04356993 , version 1 (20-12-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04356993 , version 1

Cite

Ugo Dal Lago, Gabriele Vanoni. (Not So) Boring Abstract Machines. ICTCS 2023 - Italian Conference on Theoretical Computer Science 2023, Sep 2023, Palermo, Italy. ⟨hal-04356993⟩
17 View
9 Download

Share

Gmail Facebook X LinkedIn More