© Elsevier
Information Processing
Letters, 101(5):220-226, 2007
We present a characterization of first-order functional programs which are quasi-terminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in these programs consist of a sequence of finitely many different function calls (up to variable renaming). Quasi-terminating programs are particularly useful for program analysis and transformation, since in this context quasi-termination often amounts to full termination.
Available: PDF (preliminary version) BibTeX-Entry