Program Logics for Homogeneous Generative Run-Time Meta-Programming

Berger, Martin; Tratt, Laurence

doi:10.2168/lmcs-11(1:5)2015

Cited by 11 publications

(15 citation statements)

References 73 publications

(190 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The code generation and execution can take place at compile-time or run-time. See [10,23,93] for research on developing models for multistage programming and [43,95] for research on type systems that support multistage programming.…”

Section: Metaprogramming With Reflectionmentioning

confidence: 99%

Incorporating quotation and evaluation into Church's type theory

Farmer

2018

Information and Computation

View full text Add to dashboard Cite

cttqe is a version of Church's type theory that includes quotation and evaluation operators that are similar to quote and eval in the Lisp programming language. With quotation and evaluation it is possible to reason in cttqe about the interplay of the syntax and semantics of expressions and, as a result, to formalize syntax-based mathematical algorithms. We present the syntax and semantics of cttqe as well as a proof system for cttqe. The proof system is shown to be sound for all formulas and complete for formulas that do not contain evaluations. We give several examples that illustrate the usefulness of having quotation and evaluation in cttqe.

show abstract

Section: Metaprogramming With Reflectionmentioning

confidence: 99%

Incorporating quotation and evaluation into Church's type theory

Farmer

2018

Information and Computation

View full text Add to dashboard Cite

show abstract

“…In this section we identify funcons for HGMP based on formalisations of HGMP by Berger and Tratt [7,8]. In [7], Berger, Tratt and Urban present a calculus for reasoning about several aspects of HGMP. Their calculus is the result of applying a semi-mechanical 'HGMPification recipe' to a standard untyped λ-calculus, similar to λ v .…”

Section: Funcons For Hgmpmentioning

confidence: 99%

“…Template Haskell [21] supports HGMP at compile-time, MetaML [22] at run-time, while Converge [23] supports both. An overview of the features of several HGMP languages is found in [7].…”

Section: Introductionmentioning

confidence: 99%

Funcons for HGMP: the fundamental constructs of homogeneous generative meta-programming (short paper)

Binsbergen

2018

Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

View full text Add to dashboard Cite

The PLanCompS project proposes a component-based approach to programming-language development in which fundamental constructs (funcons) are reused across language definitions. Homogeneous Generative Meta-Programming (HGMP) enables writing programs that generate code as data, at run-time or compile-time, for manipulation and staged evaluation. Building on existing formalisations of HGMP, this paper introduces funcons for HGMP and demonstrates their usage in component-based semantics.

show abstract

“…MetaOCaml [Calcagno et al 2003;Kiselyov 2014] implements a classic staging system based on quasi-quotation. The semantics of multi-stage programming are still a subject of ongoing study [Berger et al 2017;Ge and Garcia 2017].…”

Section: Related Workmentioning

confidence: 99%

Collapsing towers of interpreters

Amin

Rompf

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as input programs, we aim to collapse this tower into a compiler that removes all interpretive overhead and runs in a single pass. In the real world, a use case might be Python code executed by an x86 runtime, on a CPU emulated in a JavaScript VM, running on an ARM CPU. Collapsing such a tower can not only exponentially improve runtime performance, but also enable the use of base-language tools for interpreted programs, e.g., for analysis and verification. In this paper, we lay the foundations in an idealized but realistic setting. We present a multi-level lambda calculus that features staging constructs and stage polymorphism: based on runtime parameters, an evaluator either executes source code (thereby acting as an interpreter) or generates code (thereby acting as a compiler). We identify stage polymorphism, a programming model from the domain of high-performance program generators, as the key mechanism to make such interpreters compose in a collapsible way. We present Pink, a meta-circular Lisp-like evaluator on top of this calculus, and demonstrate that we can collapse arbitrarily many levels of self-interpretation, including levels with semantic modifications. We discuss several examples: compiling regular expressions through an interpreter to base code, building program transformers from modified interpreters, and others. We develop these ideas further to include reflection and reification, culminating in Purple, a reflective language inspired by Brown, Blond, and Black, which realizes a conceptually infinite tower, where every aspect of the semantics can change dynamically. Addressing an open challenge, we show how user programs can be compiled and recompiled under user-modified semantics.

show abstract

Program Logics for Homogeneous Generative Run-Time Meta-Programming

Cited by 11 publications

References 73 publications

Incorporating quotation and evaluation into Church's type theory

Incorporating quotation and evaluation into Church's type theory

Funcons for HGMP: the fundamental constructs of homogeneous generative meta-programming (short paper)

Collapsing towers of interpreters

Contact Info

Product

Resources

About