1. Typed applicative structures and normalization by evaluation for system Fω;Abel,2009
2. Normalization by evaluation for Martin–Löf type theory with typed equality judgements;Abel,2007
3. Algebraic proofs of cut elimination;Avigad;J. Log. Algebr. Program.,2001
4. Krivine’s intuitionistic proof of classical completeness (for countable languages);Berardi;Ann. Pure Appl. Logic,2004
5. An inverse of the evaluation functional for typed lambda-calculus;Berger,1991