1458 search results - page 7 / 292 » Extended Term Rewriting Systems |
ENTCS
2002
13 years 7 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...
RTA
2005
Springer
14 years 25 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
BIRTHDAY
2005
Springer
14 years 27 days ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
IANDC
2008
13 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...