Multi-stage programming
Multi-stage programming (MSP) is a variety of metaprogramming in which compilation is divided into a series of intermediate phases, allowing typesafe run-time code generation. Statically defined types are used to verify that dynamically constructed types are valid and do not violate the type system. In MSP languages, expressions are qualified by notation that specifies the phase at which they are to be evaluated. By allowing the specialization of a program at run-time, MSP can optimize the performance of programs: it can be considered as a form of partial evaluation that performs computations at compile-time as a trade-off to increase the speed of run-time processing. Multi-stage programming languages support constructs similar to the Lisp construct of quotation and eval, except that scoping rules are taken into account.
Multi-stage programming (MSP) is a variety of metaprogramming in which compilation is divided into a series of intermediate phases, allowing typesafe run-time code generation.[1] Statically defined types are used to verify that dynamically constructed types are valid and do not violate the type system.
In MSP languages, expressions are qualified by notation that specifies the phase at which they are to be evaluated. By allowing the specialization of a program at run-time, MSP can optimize the performance of programs: it can be considered as a form of partial evaluation that performs computations at compile-time as a trade-off to increase the speed of run-time processing.[2]
Multi-stage programming languages support constructs similar to the Lisp construct of quotation and eval, except that scoping rules are taken into account.[2]
References
[edit]- ^ Taha, Walid (2004). "A gentle introduction to multi-stage programming" (PDF). Domain-Specific Program Generation. Springer. pp. 30–50. Archived from the original (PDF) on August 4, 2017.
- ^ a b Taha, Walid; Sheard, Tim (2000). "MetaML and multi-stage programming with explicit annotations" (PDF). Theoretical Computer Science. 248 (1): 211–242. doi:10.1016/s0304-3975(00)00053-0.