A Polymorphic Groundness Analysis of Logic Programs

Details A Polymorphic Groundness Analysis of Logic Programs A Polymorphic Groundness Analysis of Logic Programs

1998-10-31

arxiv.org/abs/cs/9811001v1

Computer Science

Programming Languages

30 pages

Scientific paper

A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis. In this paper, we present a polymorphic groundness analysis that infers parameterised groundness descriptions of the variables of interest at a program point. The polymorphic groundness analysis is designed by replacing two primitive operators used in a monomorphic groundness analysis and is shown to be as precise as the monomorphic groundness analysis for any possible values for mode parameters. Experimental results of a prototype implementation of the polymorphic groundness analysis are given.

Affiliated with

Also associated with

No associations

Rating

A Polymorphic Groundness Analysis of Logic Programs 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 A Polymorphic Groundness Analysis of Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polymorphic Groundness Analysis of Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541145