2002/03/18 by Jacob M. Howe, Howe, Jacob M., Andy King +1
Computer Science · #Advanced Database Systems and Queries #D.1.6 #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.PL #f.3.2
paper · pdf · doi:10.48550/arxiv.cs/0203022
To appear in Theiry and Practice of Logic Programming
arxiv created 2002/03/18 · openalex publication_date 2002/03/18 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In order to improve precision and efficiency sharing analysis should track both freeness and linearity. The abstract unification algorithms for these combined domains are suboptimal, hence there is scope for improving precision. This paper proposes three optimisations for tracing sharing in combination with freeness and linearity. A novel connection between equations and sharing abstractions is used to establish correctness of these optimisations even in the presence of rational trees. A method for pruning intermediate sharing abstractions to improve efficiency is also proposed. The optimisations are lightweight and therefore some, if not all, of these optimisations will be of interest to the implementor.