Termination of well-moded programs

Sandro Etalle, A. Bossi, N. Cocco

    Research output: Contribution to journalArticleAcademicpeer-review

    24 Citations (Scopus)
    47 Downloads (Pure)

    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.
    Original languageEnglish
    Pages (from-to)243-257
    Number of pages15
    JournalThe Journal of Logic Programming
    Volume38
    Issue number2
    DOIs
    Publication statusPublished - Feb 1999

    Keywords

    • Well-moded programs
    • Termination
    • Modular proofs

    Fingerprint Dive into the research topics of 'Termination of well-moded programs'. Together they form a unique fingerprint.

    Cite this