Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines

Abstract

We present fully abstract encodings of the call-by-name λ-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the λ-calculus side—normal-form bisimilarity, applica-tive bisimilarity, and contextual equivalence—that we internalize into abstract machines in order to prove full abstraction.
Fichier principal
Vignette du fichier
lics.pdf (361.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01479035 , version 1 (28-02-2017)

Identifiers

Cite

Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005118⟩. ⟨hal-01479035⟩
602 View
422 Download

Altmetric

Share

Gmail Facebook X LinkedIn More