Abstract
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 …
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 language | English GB |
---|---|
Title of host publication | Logic Programming, Proceedings of the Tenth International Conference on Logic Programming, Budapest, Hungary, June 21-25, 1993 |
Editors | David Scott Warren |
Publisher | MIT Press Journals |
Pages | 116-131 |
Number of pages | 16 |
State | Published - 1993 |