1. Barbanera F., Berardi S. Witness extraction in classical logic through normalization, Technical Report Dipartimento di Informatica Universita' di Torino, 1991.
2. Berardi S. A semantic purely intuitionistic proof of Takeuti's conjecture. Rendiconti del Seminario Matematico Univers. Politecn. Torino, vol.46, 59–89, 1988.
3. Felleisen M., Friedman D., Kohlbeker E., Duba B. Reasoning with continuations. In Proceedings of the First Annual Symposium on Logic in Computer Science, 131–141, 1986.
4. Friedman H. Classically and intuitionistically provable recursive functions. In Scott D.S. and Muller G.H. editors, Higher Set Theory, vol.699 of Lecture Notes in Mathematics, 21–28, Springer Verlag, 1978.
5. Geuvers H., Nederhof M.J. A simple modular proof of the strong normalization for the Calculus of Construction. To appear in Journal of functional Programming.