This extended abstract describes work in progress on termination analysis of strongly typed logic programs. A basic difference with existing work on the topic is that in our approach we use the type of a term to derive a number of basic measures - rather than a single sophisticated measure - by which the size of a term can be measured. The basic idea is to characterise the size of a term by counting the number of subterms of a particular type it has. This characterisation allows to compare the sizes of terms of different but related types and to construct size relations between such terms in a straightforward way. Precisely the construction of such size relations has been a major point of difficulty in other type-based approaches.
Published: W. Vanhoof, en M. Bruynooghe, When size does matter - Termination analysis for typed logic programs, Pre-Proceedings, LOPSTR'01 : Logic-based Program Synthesis and Transformation (Pettorossi, A., ed.), pp. 67-76, 2001
Source: PDF, 212219 bytes
Related file: W. Vanhoof, en M. Bruynooghe, When size does matter - Termination analysis for typed logic programs Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers (Pettorossi, A., ed.), vol 2372, Lecture Notes in Computer Science, pp. 129-147, 2002