1. Berger, U.: 1993a, `Program Extraction from Classical Proofs’. In: D. Leivant (ed.): Logic and Computational Complexity, LCC ‘84, Vol. 960 of Lecture Notes in Computer Science. pp. 77–97, Springer Verlag, Berlin, Heidelberg, New York.
2. Berger, U.: 1993b, `Program Extraction from Classical Proofs’. In: D. Leivant (ed.): Logic and Computational Complexity, LCC ‘84, Vol. 960 of Lecture Notes in Computer Science. pp. 91–117
3. Berger, U., M. Eberl, and H. Schwichtenberg: 1998, `Normalization by evaluation’. Submitted to: B. Möller and J.V. Tucker (eds.): Prospects for hardware foundations. NADA volume, Lecture Notes in Computer Science.
4. Berger, U. and H. Schwichtenberg: 1991, `An inverse of the evaluation functional for typed A-calculus’. In: R. Vemuri (ed.): Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 203–211, IEEE Computer Society Press, Los Alamitos.
5. Berger, U. and H. Schwichtenberg: 1995, `Program Extraction from Classical Proofs’. In: D. Leivant (ed.): Logic and Computational Complexity, LCC ‘84, Vol. 960 of Lecture Notes in Computer Science. pp. 77–97, Springer Verlag, Berlin, Heidelberg, New York.