Results 1 -
2 of
2
Partial Evaluation for Program Analysis
, 1998
"... syntax of labeled CPS terms . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Sets induced by the source program . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Shivers's original 0-CFA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1 State passing 0-CFA: funct ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
syntax of labeled CPS terms . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Sets induced by the source program . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Shivers's original 0-CFA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1 State passing 0-CFA: functionalities . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2 State-passing 0-CFA: the equations . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3 Introducing time-stamps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.1 Types of IMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4.2 Syntax of IMP programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4.3 IMP predefined constants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.4 Typing rules for IMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4.5 Interpretation of types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.6 Semantics of IMP language constructs . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.7 Interpretation of IMP constants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 4.8 ICFA: program for computing the 0-CFA . . . . . . . . . . . . . . . . . . . . . . . 20 5.1 Typing rule and semantics for the caseX construct . . . . . . . . . . . . . . . . . . 24 5.2 Call unfolding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 6.1 Example of residual function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.2 The ICFA # program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.3 ICFA ## program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
Higher-Order Code Splicing
- Proceedings of the Eighth European Symposium on Programming, number 1576 in Lecture
, 1999
"... . Run-time code generation (RTCG) and just-in-time compilation (JIT) are features of modern programming systems to strike the balance between generality and efficiency. Since RTCG and JIT techniques are not portable and notoriously hard to implement, we propose code splicing as an alternative fo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. Run-time code generation (RTCG) and just-in-time compilation (JIT) are features of modern programming systems to strike the balance between generality and efficiency. Since RTCG and JIT techniques are not portable and notoriously hard to implement, we propose code splicing as an alternative for dynamically-typed higher-order programming languages. Code splicing combines precompiled pieces of code using higher-order functions. While this approach cannot achieve the performance of compiled code, it can support some intriguing features: -- very fast "compilation" times; -- satisfactory run times, compared with interpretation; -- simple interfacing with compiled code; -- portability. Starting from implementation models for functional languages we develop and evaluate several approaches to code splicing. This leads to some new insights into compilation techniques for functional programming languages, among them a compositional compilation schema to SKI-combinators. The pro...
