Pos(T): Analyzing Dependencies in Typed Logic Programs

Abstract

. Dependencies play a major role in the analysis of program properties. The analysis of groundness dependencies for logic programs using the class of positive Boolean functions is a main applications area. Work has been done to improve its precision through the integration of either pattern information or type information. This paper develops another approach where type information is exploited. Different from previous work, a separate simple analysis is done for each subtype of the types. Also, a technique is developed that reuses the results of a polymorphic predicate for the type instances under which it is called.

Similar works

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.