Similar Items: A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- On completeness and parametricity in the realizability semantics of System F
- Simply typed convertibility is TOWER-complete even for safe lambda-terms
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
- Semantics of Typed Lambda-Calculus with Constructors
- Completeness of the ZX-Calculus