A verified framework for higher-order uncurrying optimizations

Zaynah Dargaye (1, 2) , Xavier Leroy (3)

1 ENSIIE - Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise
2 LIST (CEA) - Laboratoire d'Intégration des Systèmes et des Technologies
3 GALLIUM - Programming languages, types, compilation and proofs

Function uncurrying is an important optimization for the efficient execution of functional programming languages. This optimization replaces curried functions by uncur-ried, multiple-argument functions, while preserving the ability to evaluate partial applications. First-order uncurrying (where curried functions are optimized only in the static scopes of their definitions) is well understood and implemented by many compilers, but its extension to higher-order functions (where uncurrying can also be performed on parameters and results of higher-order functions) is challenging. This article develops a generic framework that expresses higher-order uncurrying optimizations as type-directed insertion of coercions, and prove its correctness. The proof uses step-indexed logical relations and was entirely mechanized using the Coq proof assistant.

Mots clés: Functional programming languages; Compiler optimization; Compiler verification; Semantic preservation; Mechanized verification

Domaines: Langage de programmation [cs.PL]

Zaynah Dargaye, Xavier Leroy. A verified framework for higher-order uncurrying optimizations. Higher-Order and Symbolic Computation, 2009, 22 (3), ⟨10.1007/s10990-010-9050-z⟩. ⟨hal-01499915⟩