Static Analysis Techniques for Equational Logic Programming

Details Static Analysis Techniques for Equational Logic Programming Static Analysis Techniques for Equational Logic Programming

2000-10-27

arxiv.org/abs/cs/0010034v1

Computer Science

Logic in Computer Science

Appeared in 1st ACM SIGPLAN Workshop on Rule-based Programming (RULE 2000)

Scientific paper

An equational logic program is a set of directed equations or rules, which are used to compute in the obvious way (by replacing equals with ``simpler'' equals). We present static analysis techniques for efficient equational logic programming, some of which have been implemented in $LR^2$, a laboratory for developing and evaluating fast, efficient, and practical rewriting techniques. Two novel features of $LR^2$ are that non-left-linear rules are allowed in most contexts and it has a tabling option based on the congruence-closure based algorithm to compute normal forms. Although, the focus of this research is on the tabling approach some of the techniques are applicable to the untabled approach as well. Our presentation is in the context of $LR^2$, which is an interpreter, but some of the techniques apply to compilation as well.

Affiliated with

Also associated with

No associations

Rating

Static Analysis Techniques for Equational Logic Programming 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 Static Analysis Techniques for Equational Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Static Analysis Techniques for Equational Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-199716