Quasi-terminating logic programs for ensuring the termination of partial evaluation
Germán Vidal · 2007
One of the most important challenges in partial evaluation is the design of automatic methods for ensuring the termination of specialisation. It is well known that the termination of partial evaluation can be ensured when the considered computations are quasiterminating, i.e., when only finitely many different calls occur.