Abstract
We present a novel set of meta-programming primitives for use in a dependently-typed functional language. The types of our metaprograms provide strong and precise guarantees about their termination, correctness and completeness. Our system supports typesafe construction and analysis of terms, types and typing contexts. Unlike alternative approaches, they are written in the same style as normal programs and use the language's standard functional computational model. We formalise the new meta-programming primitives, implement them as an extension of Agda, and provide evidence of usefulness by means of two compelling applications in the fields of datatype-generic programming and proof tactics.
| Original language | English |
|---|---|
| Pages (from-to) | 73-85 |
| Number of pages | 13 |
| Journal | ACM SIGPLAN Notices |
| Volume | 48 |
| Issue number | 9 |
| Publication status | Published - 1 Sep 2013 |
Keywords
- Datatype-generic programming
- Dependent types
- Meta-programming
- Tactics