Lazy AC-Pattern Matching for Rewriting

Details Lazy AC-Pattern Matching for Rewriting Lazy AC-Pattern Matching for Rewriting

2012-04-25

arxiv.org/abs/1204.5543v1

EPTCS 82, 2012, pp. 37-51

Computer Science

Logic in Computer Science

In Proceedings WRS 2011, arXiv:1204.5318

Scientific paper

10.4204/EPTCS.82.3

We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.

Affiliated with

Also associated with

No associations

Rating

Lazy AC-Pattern Matching for Rewriting 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 Lazy AC-Pattern Matching for Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lazy AC-Pattern Matching for Rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137338