It extends the approach of argument-bounded functions (i) by inspecting type components and (ii) by adding a facility to take care of second-order recursion.

It extends the approach of argument-bounded functions (i) by inspecting type components and (ii) by adding a facility to take care of second-order recursion.

Abstract. Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion:.

We present a method for automated termina- tion analysis of such procedures. It extends the approach of argument- bounded functions in two respects: Firstly, it ...

It extends the approach of argument-bounded functions (i) by inspecting type components and (ii) by adding a facility to take care of second-order recursion.

Bibliographic details on Automated Termination Analysis for Programs with Second-Order Recursion.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

The technique of proving the termination of incompletely defined programs maintains performance as well as simplicity of the original method and is proved ...

For a class of linear recursive logic programs satisfying so-called \translativeness" property, precise interargument constraints can be obtained via the ...

Abstract. For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded.