The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A self-applicable partial evaluator and its use in incremental compilation
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
Mixed computation of Prolog programs
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
Using unavoidable set of trees to generalize Kruskal's theorem
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Partial evaluation in logic programming
Journal of Logic Programming
A partial evaluation procedure for logic programs
Proceedings of the 1990 North American conference on Logic programming
Automatic online partial evaluation
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Essence of generalized partial computation
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Tutorial on specialisation of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Topics in online partial evaluation
Topics in online partial evaluation
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
Sound and complete partial deduction with unfolding based on well-founded measures
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Complexity bounds for some finite forms of Kruskal's theorem
Journal of Symbolic Computation
Meta-logics and logic programming
Meta-logics and logic programming
An introduction to partial evaluation
ACM Computing Surveys (CSUR)
Simple termination of rewrite systems
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving termination with multiset orderings
Communications of the ACM
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Narrowing-Driven Partial Evaluation of Functional Logic Programs
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Fundamental Structures in Well-Structured Infinite Transition Systems
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Controlling Conjunctive Partial Deduction
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
On the Mechanics of Metasystem Hierarchies in Program Transformation
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Conjunctive Partial Deduction in Practice
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
A Roadmap to Metacomputation by Supercompilation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Selected Papers from the Internaltional Seminar on Partial Evaluation
A Comparative Revisitation of Some Program Transformation Techniques
Selected Papers from the Internaltional Seminar on Partial Evaluation
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Convergence of Program Transformers in the Metric Space of Trees
MPC '98 Proceedings of the Mathematics of Program Construction
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computational problems in equational theorem proving
Computational problems in equational theorem proving
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Solving planning problems by partial deduction
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Rules + strategies for transforming lazy functional logic programs
Theoretical Computer Science
Fast narrowing-driven partial evaluation for inductively sequential programs
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
The Ecce and Logen partial evaluators and their web interfaces
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Forward slicing of functional logic programs by partial evaluation
Theory and Practice of Logic Programming
Quasi-terminating logic programs for ensuring the termination of partial evaluation
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Efficient and flexible access control via Jones-optimal logic program specialisation
Higher-Order and Symbolic Computation
A Supercompiler for Core Haskell
Implementation and Application of Functional Languages
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Logic-Based Program Synthesis and Transformation
Type-based homeomorphic embedding for online termination
Information Processing Letters
Decompilation of Java bytecode to Prolog by partial evaluation
Information and Software Technology
Supervising offline partial evaluation of logic programs using online techniques
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
A fast algebraic web verification service
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Taming code explosion in supercompilation
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Efficient local unfolding with ancestor stacks*
Theory and Practice of Logic Programming
Program specialization for verifying infinite state systems: an experimental evaluation
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
A hybrid approach to conjunctive partial evaluation of logic programs
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Annotation of logic programs for independent and-parallelism by partial evaluation*
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems.