POPL 2027
Sun 10 - Sat 16 January 2027 Mexico City, Mexico

There is an expressivity gap between proof assistants based on dependent type theory (DTT), such as Lean and Rocq, and automated theorem provers based on higher order logic (HOL). This gap has been reduced with the introduction of dependently typed HOL (DHOL) along with automated theorem proving for DHOL. To reduce the gap even further, we introduce a translation from a fragment of DTT to polymorphic DHOL. The translation is sound and lightweight, preserving constructs such as polymorphism and dependent types. An empirical evaluation finds that the translatable fragment is large in practice, suggesting that the translation could be used in a hammer system.