A rational reconstruction of homogeneous meta-programming

Martin Berger

Department of Informatics, University of Sussex

Abstract: 

Homogeneous generative meta-programming (HGMP) enables the generation of program fragments at compile-time or run-time. We present the first foundational calculus which can model powerful HGMP languages such as Template Haskell. The calculus is designed such that we can gradually enhance it with the features needed to model many of the advanced features of real languages. As a demonstration of the flexibility of our approach, we also provide a simple type system for the calculus. We discuss the difficulties we encountered with formalising HGMP using Nominal Isabelle.

Where: 
6.3.5
When: 
Tuesday, June 21 2016
Time: 
11:00