Termination of well-moded programs

Sandro Etalle; A. Bossi; N. Cocco

doi:10.1016/S0743-1066(98)10025-0

Termination of well-moded programs

Sandro Etalle, A. Bossi, N. Cocco

Research output: Contribution to journal › Article › Academic › peer-review

24 Citations (Scopus)

112 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 language	English
Pages (from-to)	243-257
Number of pages	15
Journal	The Journal of Logic Programming
Volume	38
Issue number	2
DOIs	https://doi.org/10.1016/S0743-1066(98)10025-0
Publication status	Published - Feb 1999

Keywords

Well-moded programs
Termination
Modular proofs

Access to Document

10.1016/S0743-1066(98)10025-0Licence: Other

etalleFinal published version, 0.98 MBLicence: Other

Cite this

@article{9df2da8253414bf0b4bf58a72e72e809,

title = "Termination of well-moded programs",

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.",

keywords = "Well-moded programs, Termination, Modular proofs",

author = "Sandro Etalle and A. Bossi and N. Cocco",

note = "Imported from DIES",

year = "1999",

month = feb,

doi = "10.1016/S0743-1066(98)10025-0",

language = "English",

volume = "38",

pages = "243--257",

journal = "The Journal of Logic Programming",

issn = "0743-1066",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Termination of well-moded programs

AU - Etalle, Sandro

AU - Bossi, A.

AU - Cocco, N.

N1 - Imported from DIES

PY - 1999/2

Y1 - 1999/2

N2 - 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.

AB - 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.

KW - Well-moded programs

KW - Termination

KW - Modular proofs

U2 - 10.1016/S0743-1066(98)10025-0

DO - 10.1016/S0743-1066(98)10025-0

M3 - Article

SN - 0743-1066

VL - 38

SP - 243

EP - 257

JO - The Journal of Logic Programming

JF - The Journal of Logic Programming

IS - 2

ER -

Termination of well-moded programs

Abstract

Keywords

Access to Document

Fingerprint

Cite this