Transformation systems and nondeclarative properties

A. Bossi, N. Cocco, S. Etalle

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    1 Citation (Scopus)
    1 Downloads (Pure)

    Abstract

    Program transformation systems are applied both in program synthesis and in program optimization. For logic programs the "logic" component makes transformations very natural and easy to be studied formally. But, when we move to Prolog programs, the "control" component cannot be ignored. In particular we need to cope with termination properties which are essential for ensuring the reachability of solutions for a given query. We give an overview of the main proposals in the field of transformation systems for logic programs and we emphasize how they cope with those properties of logic programs which are not strictly declarative. We focus in particular on how the transformation can affect the termination of a program.
    Original languageEnglish
    Title of host publicationComputational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
    EditorsA.C. Kakas, F. Sadri
    PublisherSpringer
    Pages162-186
    ISBN (Print)3-540-43959-5
    DOIs
    Publication statusPublished - 2002

    Publication series

    NameLecture notes in computer science
    Volume2407

    Fingerprint

    Dive into the research topics of 'Transformation systems and nondeclarative properties'. Together they form a unique fingerprint.

    Cite this