Modelling Homogeneous Generative Meta-programming

TY - JOUR

T1 - Modelling Homogeneous Generative Meta-programming

AU - Berger, Martin

AU - Tratt, Laurence Robert

AU - Urban, Christian

PY - 2017/6/16

Y1 - 2017/6/16

N2 - Homogeneous generative meta-programming (HGMP) enables the generation of program fragments at compile-time or run-time. We present a foundational calculus which can model bott compile-time and run-time evaluated HGMP, allowing us to model, for the first time, languages such as Template Haskell. The calculus is designed such that it can be gradually enhanced withthe features needed to model many of the advanced features of real languages. We demonstrate this by showing how a simple, staged type system as found in Template Haskell can be added to the calculus.

AB - Homogeneous generative meta-programming (HGMP) enables the generation of program fragments at compile-time or run-time. We present a foundational calculus which can model bott compile-time and run-time evaluated HGMP, allowing us to model, for the first time, languages such as Template Haskell. The calculus is designed such that it can be gradually enhanced withthe features needed to model many of the advanced features of real languages. We demonstrate this by showing how a simple, staged type system as found in Template Haskell can be added to the calculus.

U2 - 10.4230/LIPIcs.ECOOP.2017.5

DO - 10.4230/LIPIcs.ECOOP.2017.5

M3 - Conference paper

SN - 1868-8969

VL - 74

JO - Leibniz International Proceedings in Informatics, LIPIcs

JF - Leibniz International Proceedings in Informatics, LIPIcs

ER -