Similar Items: Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
- Simply typed convertibility is TOWER-complete even for safe lambda-terms
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
- Asymptotically almost all lambda-terms are strongly normalizing
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- An extended type system with lambda-typed lambda-expressions
- Normalizing the Taylor expansion of non-deterministic {lambda}-terms, via parallel reduction of resource vectors