The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Journal of Symbolic Computation
Techniques for partial evaluation of imperative languages
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Automatic autoprojection of recursive equations with global variable and abstract data types
Science of Computer Programming
Essence of generalized partial computation
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Topics in online partial evaluation
Topics in online partial evaluation
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
Simple termination of rewrite systems
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Automatic Online Partial Evaluation
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
A Roadmap to Metacomputation by Supercompilation
Selected Papers from the Internaltional Seminar on Partial Evaluation
A Uniform Approach for Compile-Time and Run-Time Specialization
Selected Papers from the Internaltional Seminar on Partial Evaluation
| Hi-index | 0.00 |
Well-quasi orderings, and particularly homeomorphic embedding, recently became popular to ensure the termination of program specialization and transformation techniques. In this paper, we present a termination approach called recursive condition approach to ensure the termination of online specializers. Just like some traditional approaches, recursive condition approach is also based on well-quasi orderings using homeomorphic embedding. However, instead of using the arguments of functions, the conditions invoking recursive calls are used. Because the recursive condition approach exploits the recursive conditions which, to some extent, contain some semantic information of original programs, we believe this approach is more adequate and can produce more efficient residual programs than traditional approaches using well-quasi orderings/homeomorphic embedding. Furthermore, we present an approach (called combined approach) that combines the advantages of the recursive condition approach and the traditional approach.