1. A formalization of the strong normalization proof for system F in LEGO;Altenkirch,1993
2. Parameter free induction and provably total computable functions;Beklemishev;Theoret. Comput. Sci.,1999
3. Proving termination of programs having transition invariants of height ω;Berardi,2014
4. An analysis of the Podelski–Rybalchenko termination theorem via bar recursion;Berardi;J. Logic Comput.,2015
5. Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic;Berardi,2013