On the unification free Prolog programs

Andrzej M. Borzyszkowski (Editor), Krzysztof R. Apt, Stefan Sokolowski (Editor), Sandro Etalle

    Research output: Contribution to conferencePaperAcademicpeer-review

    35 Citations (Scopus)
    85 Downloads (Pure)

    Abstract

    We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are types and generic expressions for types. As already noticed by other researchers, such a replacement offers a possibility of improving the efficiency of program's execution.
    Original languageEnglish
    Pages1-19
    Number of pages19
    DOIs
    Publication statusPublished - Aug 1993
    Event18th International Symposium on Mathematical Foundations of Computer Science, MFCS 1993 - Gdansk, Poland
    Duration: 30 Aug 19933 Sep 1993

    Conference

    Conference18th International Symposium on Mathematical Foundations of Computer Science, MFCS 1993
    Period30/08/933/09/93
    OtherAugust 30 - September 3, 1993

    Keywords

    • EWI-1193
    • IR-56283

    Fingerprint Dive into the research topics of 'On the unification free Prolog programs'. Together they form a unique fingerprint.

    Cite this