Transformation of left terminating programs

A. Bossi, N. Cocco, S. Etalle

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)

    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 languageEnglish
    Title of host publicationLogic Programming Synthesis and Transformation (9th International Workshop, LOPSTR'99, Venezia, Italy, September 22-24, 1999, Selected Papers)
    EditorsA. Bossi
    PublisherSpringer
    Pages156-175
    ISBN (Print)3-540-67628-7
    DOIs
    Publication statusPublished - 2000

    Publication series

    NameLecture Notes in Computer Science
    Volume1817
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'Transformation of left terminating programs'. Together they form a unique fingerprint.

    Cite this