Similar Items: Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- Simply typed convertibility is TOWER-complete even for safe lambda-terms
- A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
- Fully Abstract Encodings of $lambda$-Calculus in HOcore through Abstract Machines
- Semantics of Typed Lambda-Calculus with Constructors
- Intersection Types for the lambda-mu Calculus
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata