Analyzing logic programs with dynamic scheduling

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

    28 Citations (Scopus)

    Abstract

    Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-to-right but in which some calls are dynamically 'delayed' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.

    Original languageEnglish
    Title of host publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
    PublisherAssociation for Computing Machinery (ACM)
    Pages240-253
    Number of pages14
    ISBN (Print)0897916360
    Publication statusPublished - 1 Jan 1994
    EventProceedings of the 21st Annual ACM Symposium on Principles of Programming Languages - Portland, OR, USA
    Duration: 17 Jan 199421 Jan 1994

    Conference

    ConferenceProceedings of the 21st Annual ACM Symposium on Principles of Programming Languages
    CityPortland, OR, USA
    Period17/01/9421/01/94

    Cite this

    Marriott, K., de la Banda, M. L. G., & Hermenegildo, M. (1994). Analyzing logic programs with dynamic scheduling. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 240-253). Association for Computing Machinery (ACM).