1458 search results - page 7 / 292 » Extended Term Rewriting Systems |
111
Voted
ENTCS
2002
15 years 7 days 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...
121
click to vote
RTA
2005
Springer
15 years 6 months 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...
99
Voted
BIRTHDAY
2005
Springer
15 years 6 months 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...
89
Voted
IANDC
2008
15 years 15 days 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...
109
click to vote
CORR
2006
Springer
15 years 14 days 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...