Interpreting Specialization in Type Theory

We define the static semantics of offline partial evaluation for the simply-typed lambda calculus using a translation into a Martin-Löf-style type theory with suitable extensions. Our approach clarifies that the distinction between specialization -time and run-time computation in partial evaluation can model the phase distinction between compile-time and run-time computation in a module language. Working backwards from that connection, we define partial evaluation for a core language with modules

Interpreting Specialization in Type Theory

We define the static semantics of offline partial evaluation for the simply-typed lambda calculus using a translation into a Martin-Löf-style type theory with suitable extensions. Our approach clarifies that the distinction between specialization-time and run-time computation in partial evaluation can model the phase distinction between compile-time and run-time computation in a module language. Working backwards from that connection, we define partial evaluation for a core language with modules