Three Optimisations for Sharing

Details Three Optimisations for Sharing Three Optimisations for Sharing

2002-03-18

arxiv.org/abs/cs/0203022v1

Computer Science

Programming Languages

To appear in Theiry and Practice of Logic Programming

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Three Optimisations for Sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three Optimisations for Sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three Optimisations for Sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575859