On the Power of Homeomorphic Embedding for Online Termination
Author:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 230-245
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A roadmap to metacomputation by supercompilation1996
- Narrowing-driven partial evaluation of functional logic programsLecture Notes in Computer Science, 1996
- Controlling conjunctive partial deductionLecture Notes in Computer Science, 1996
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Loop checking in partial deductionThe Journal of Logic Programming, 1993
- Tutorial on specialisation of logic programs1993
- A general criterion for avoiding infinite unfolding during partial deductionNew Generation Computing, 1992
- Rewrite Systems1990
- Termination of rewritingJournal of Symbolic Computation, 1987
- Proving termination with multiset orderingsCommunications of the ACM, 1979