Transformation of left terminating programs

A. Bossi, N. Cocco, S. Etalle

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    2 Citaten (Scopus)

    Samenvatting

    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.
    Originele taal-2Engels
    TitelLogic Programming Synthesis and Transformation (9th International Workshop, LOPSTR'99, Venezia, Italy, September 22-24, 1999, Selected Papers)
    RedacteurenA. Bossi
    UitgeverijSpringer
    Pagina's156-175
    ISBN van geprinte versie3-540-67628-7
    DOI's
    StatusGepubliceerd - 2000

    Publicatie series

    NaamLecture Notes in Computer Science
    Volume1817
    ISSN van geprinte versie0302-9743

    Vingerafdruk Duik in de onderzoeksthema's van 'Transformation of left terminating programs'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit