Termination of well-moded programs

S Etalle, A Bossi, N Cocco*

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    Abstract

    We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization - in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150-176 - of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check. (C) 1999 Elsevier Science Inc, All rights reserved.

    Original languageEnglish
    Pages (from-to)243-257
    Number of pages15
    JournalJournal of Logic Programming
    Volume38
    Issue number2
    DOIs
    Publication statusPublished - Feb 1999

    Keywords

    • termination
    • well-moded programs
    • modular proofs
    • LOGIC PROGRAMS
    • PROVING TERMINATION
    • PROLOG PROGRAMS

    Cite this