498 search results - page 12 / 100 » Term Rewriting |
ENTCS
2002
14 years 9 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...
WADT
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
81
Voted
ENTCS
2008
14 years 9 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...