Thomas Colcombet (IRIF) with David Barozzini, Lorenzo Clemente and Paweł Parys (Univ Warsaw) will virtually present at ICALP'20 how to compute downward closures of safe recursion schemes, objects that give meaningful information about the behavior of higher order programs. This paper got the best paper award of ICALP/Tack-B.