More Precise Yet Efficient Type Inference for Logic Programs

Details More Precise Yet Efficient Type Inference for Logic Programs More Precise Yet Efficient Type Inference for Logic Programs

2002-07-11

arxiv.org/abs/cs/0207049v2

Computer Science

Software Engineering

14 pages; Alexandre Tessier, editor; WLPE 2002, http://xxx.lanl.gov/abs/cs.SE/0207052

Scientific paper

Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for logic programs, built on either top-down or bottom-up interpretation of the program. In this setting, we discuss the widening operator, arguably a crucial one. We present a new widening which is more precise than those previously proposed. Practical results with our analysis domain are also presented, showing that it also allows for efficient analysis.

Affiliated with

Also associated with

No associations

Rating

More Precise Yet Efficient Type Inference for 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 More Precise Yet Efficient Type Inference for Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More Precise Yet Efficient Type Inference for Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185255