1. On the computational content of the axiom of choice;Berardi;J. Symbolic Logic,1998
2. U. Berger, The Berardi–Bezem–Coquand functional in a domain-theoretic setting, Unpublished results, available from author's webpage at http://www.cs.swan.ac.uk/~csulrich/recent-papers.html, 2002.
3. A computational interpretation of open induction;Berger,2004
4. Strong normalization for applied lambda calculi;Berger;Log. Methods Comput. Sci.,2005
5. Modified bar recursion and classical dependent choice;Berger,2005