Transformation of Left Terminating Programs

Annalisa Bossi; Nicoletta Cocco; Sandro Etalle

doi:10.1007/10720327_10

Transformation of Left Terminating Programs

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

Research output: Contribution to conference › Paper › Academic › peer-review

2 Citations (Scopus)

50 Downloads (Pure)

Abstract

We propose an unfold-fold transformation system which preserves left termination for definite programs besides its declarative semantics. The system extends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode information

Original language	Undefined
Pages	156-175
Number of pages	20
DOIs	https://doi.org/10.1007/10720327_10
Publication status	Published - 2000
Event	9th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '99 - Venezia, Italy Duration: 22 Sep 1999 → 24 Sep 1999

Workshop

Workshop	9th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '99
Period	22/09/99 → 24/09/99
Other	September 22-24, 1999

Keywords

EWI-982
IR-56161

Access to Document

10.1007/10720327_10

bossi00transformation
open

Cite this

@conference{5e19f9f292464d60a2115c330595af00,

title = "Transformation of Left Terminating Programs",

abstract = "We propose an unfold-fold transformation system which preserves left termination for definite programs besides its declarative semantics. The system extends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode information",

keywords = "EWI-982, IR-56161",

author = "Annalisa Bossi and Nicoletta Cocco and Sandro Etalle",

note = "Imported from DIES; null ; Conference date: 22-09-1999 Through 24-09-1999",

year = "2000",

doi = "10.1007/10720327_10",

language = "Undefined",

pages = "156--175",

}

TY - CONF

T1 - Transformation of Left Terminating Programs

AU - Bossi, Annalisa

AU - Cocco, Nicoletta

AU - Etalle, Sandro

N1 - Imported from DIES

PY - 2000

Y1 - 2000

N2 - We propose an unfold-fold transformation system which preserves left termination for definite programs besides its declarative semantics. The system extends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode information

AB - We propose an unfold-fold transformation system which preserves left termination for definite programs besides its declarative semantics. The system extends our previous proposal in [BCE95] by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode information

KW - EWI-982

KW - IR-56161

U2 - 10.1007/10720327_10

DO - 10.1007/10720327_10

M3 - Paper

SP - 156

EP - 175

Y2 - 22 September 1999 through 24 September 1999

ER -