Freeness Analysis for Logic Programs - And Correctness?

Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe

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


Several proposals for computing freeness information for logic programs have been put forward in recent literature. The availability of such information has proven useful in a variety
of applications. While these proposals have illustrated the importance of such analyses, they lack formal justification. Moreover, several have been found incorrect. This paper introduces a novel domain of abstract eguation systems describing possible sharing and definite freeness of terms in a system of equations. A simple and intuitive abstract unification …
Original languageEnglish GB
Title of host publicationLogic Programming, Proceedings of the Tenth International Conference on Logic Programming, Budapest, Hungary, June 21-25, 1993
EditorsDavid Scott Warren
PublisherMIT Press Journals
Number of pages16
StatePublished - 1993


Dive into the research topics of 'Freeness Analysis for Logic Programs - And Correctness?'. Together they form a unique fingerprint.

Cite this