1. Altenkirch, T., Dybjer, P., Hofmann, M., & Scott, P. (2001). Normalization by Evaluation for typed lambda calculus with coproducts. Proceedings of Logic in Computer Science (pp. 203–210).
2. Barbanera, F. & Berardi, S. (1994). A symmetric lambda calculus for “classical” program extraction. Theoretical Aspects of Computer Software, volume 789 of LNCS (pp. 495–515). Springer.
3. Barendregt, H., & Ghilezan, S. (2000). Theoretical pearls: Lambda terms for natural deduction, sequent calculus and cut elimination. Journal of Functional Programming, 10(1), 121–134.
4. Bloo, R. (1997). Preservation of termination for explicit substitution. Ph.D. thesis. Eindhoven University of Technology.
5. Espírito Santo, J. C. (2000). Revisiting the correspondence between cut elimination and normalisation. Proceedings of ICALP 2000, volume 1853 of LNCS (pp. 600–611). Springer.