Similar Items: Discriminating Lambda-Terms Using Clocked Boehm Trees
- No solvable lambda-value term left behind
- Asymptotically almost all lambda-terms are strongly normalizing
- On the Taylor expansion of $lambda$-terms and the groupoid structure of their rigid approximants
- Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
- Simply typed convertibility is TOWER-complete even for safe lambda-terms
- Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory