Search

• < Previous
• 1
• Next >

Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines

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&nbsp;[&hellip;]