A rational reconstruction of homogeneous metaprogramming
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Dominic Mulligan.
Homogeneous generative metaprogramming (HGMP) enables the generation of program fragments at compiletime or runtime. 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.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
