Compiler design for hyper-metaprogramming

Although static metaprogramming is not a new technique and is present in some of the most popular programming languages today, it is still considered an esoteric feature. This is mainly because writing metaprograms requires syntactic constructs and programming abstractions different from those used for writing regular programs. We propose in this paper the concept of hyper-metaprogramming, a new kind of Turing-complete compile-time metaprogramming, which allows metaprograms to be written in the same way as traditional programs: with the same abstractions, syntax, and semantics. Using this feature, programmers can easily implement any complex algorithms and data structures at compile-time, before producing the final run-time program. The paper focuses on discussing the main mechanisms involved in implementing hyper-metaprogramming.