Fully Abstract Encodings of Lambda-Calculus in HOcore through Abstract Machines - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2024

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

Résumé

We present fully abstract encodings of the call-by-name and call-by-value lambda-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the lambda-calculus side -- normal-form bisimilarity, applicative bisimilarity, and contextual equivalence -- that we internalize into abstract machines in order to prove full abstraction of the encodings. We also demonstrate that this technique scales to the lambda mu-calculus, i.e., a standard extension of the lambda-calculus with control operators.

Dates et versions

hal-04638249 , version 1 (08-07-2024)

Licence

Identifiants

Citer

Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, et al.. Fully Abstract Encodings of Lambda-Calculus in HOcore through Abstract Machines. Logical Methods in Computer Science, 2024, Volume 20, Issue 3, ⟨10.46298/lmcs-20(3:3)2024⟩. ⟨hal-04638249⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More