1. On the computational content of the axiom of choice;Berardi;JSL,1998
2. “Classical” programming-with-proofs in λPASym: An analysis of non-confluence;Barbanera,1997
3. Proof theory at work: Program development in the Minlog system;Benl,1998
4. A computational interpretation of open induction;Berger,2004
5. Uniform Heyting arithmetic;Berger;Annals of Pure and Applied Logic,2005