Similar Items: Fully Abstract Encodings of $lambda$-Calculus in HOcore through Abstract Machines
- Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
- Encoding many-valued logic in $lambda$-calculus
- A Fully Abstract Model of PCF Based on Extended Addressing Machines
- Inductive Definition and Domain Theoretic Properties of Fully Abstract
- Modular, Fully-abstract Compilation by Approximate Back-translation
- Addressing Machines as models of lambda-calculus