## Extending Homeomorphic Embedding in the Context of Logic Programming (1997)

### Cached

### Download Links

- [www.cs.kuleuven.ac.be]
- [www.cs.kuleuven.be]
- [www.pms.informatik.uni-muenchen.de]
- [ftp.cs.kuleuven.ac.be]
- DBLP

### Other Repositories/Bibliography

Venue: | Departement Computerwetenschappen |

Citations: | 2 - 1 self |

### BibTeX

@TECHREPORT{Leuschel97extendinghomeomorphic,

author = {Michael Leuschel},

title = {Extending Homeomorphic Embedding in the Context of Logic Programming},

institution = {Departement Computerwetenschappen},

year = {1997}

}

### OpenURL

### Abstract

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.