| Autor: |
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.46298/lmcs-20(3:3)2024 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
