Termination Analysis of Typed Logic Programs (2003)
BibTeX
@MISC{Lagoon03terminationanalysis,
author = {Vitaly Lagoon and Fred Mesnard and Peter J. Stuckey and Etienne Payet and Fausto Spoto},
title = {Termination Analysis of Typed Logic Programs},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed logic programs to determine more accurate termination of (type correct) programs. Type information for programs may be either inferred automatically or declared by the programmer. The analysis of the typed logic programs is able to completely reuse a framework for termination analysis of untyped logic programs by using abstract compilation of the type abstraction. We define a methodology for mapping a typed logic program to a type separated CLP(N) program that allows us to automatically determine termination characteristics of the original program. We demonstrate how the approach is able to prove termination of programs which the untyped analysis can not.
