Similar Items: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
- Simply typed convertibility is TOWER-complete even for safe lambda-terms
- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- Semantics of Typed Lambda-Calculus with Constructors
- A revised completeness result for the simply typed $lambdamu$-calculus using realizability semantics
- Power of Randomization in Automata on Infinite Strings