Many programming languages and proof assistants are defined by elaboration from a high-level language with a great deal of implicit information to a highly explicit core language. In many advanced languages, these elaboration facilities contain powerful tools for program construction, but these tools are rarely designed to be repurposed by users. We describe elaborator reflection, a paradigm for metaprogramming in which the elaboration machinery is made directly available to metaprograms, as well as a concrete realization of elaborator reflection in Idris, a functional language with full dependent types. We demonstrate the applicability of Idris's reflected elaboration framework to a number of realistic problems, we discuss the motivation for the specific features of its design, and we explore the broader meaning of elaborator reflection as it can relate to other languages.
Tue 20 SepDisplayed time zone: Osaka, Sapporo, Tokyo change
15:05 - 16:20
|Unifiers as Equivalences: Proof-Relevant Unification of Dependently Typed Data|
|Elaborator Reflection: Extending Idris in Idris|
|Partial Type Equivalences for Verified Dependent Interoperability|
Pierre-Evariste Dagand UPMC, France, Nicolas Tabareau Inria, France, Éric Tanter University of Chile, ChileDOI