Transformation of Left Terminating Programs

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

    Research output: Contribution to conferencePaperAcademicpeer-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 languageUndefined
    Pages156-175
    Number of pages20
    DOIs
    Publication statusPublished - 2000
    Event9th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '99 - Venezia, Italy
    Duration: 22 Sep 199924 Sep 1999

    Workshop

    Workshop9th International Workshop on Logic Program Synthesis and Transformation, LOPSTR '99
    Period22/09/9924/09/99
    OtherSeptember 22-24, 1999

    Keywords

    • EWI-982
    • IR-56161

    Cite this