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.
| Origin | Files produced by the author(s) |
|---|