1385 search results - page 21 / 277 » Natural Rewriting for General Term Rewriting Systems |
128
click to vote
PLILP
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
113
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
120
click to vote
ENTCS
2002
15 years 1 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
136
click to vote
TCS
2002
15 years 1 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
127
click to vote
ENTCS
2007
15 years 1 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...