Extending homeomorphic embedding in the context of logic programming
Michaël Leuschel · 1997
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transformation techniques. However, as we illustrate in the paper, the homeomorphic embedding relation as it is usually defined suffers from several inadequacies which make it less suitable in a logic programming context. We present several increasingly refined ways to remedy this problem by providing more sophisticated treatments of variables and present a new, extended homeomorphic embedding relation. Keywords : Termination, Well-quasi orders, Logic Programming, Program Transformation, Program Analysis, Partial Deduction. CR Subject Classification : I.2.3, I.2.2, F.4.1, D.1.6. Extending Homeomorphic Embedding in the Context of Logic Programming Michael Leuschel Departement Computerwetenschappen Katholieke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, Belgium e-mail : [email protected] www :...