Sciweavers

74 search results - page 4 / 15
» Extending Context-Sensitivity in Term Rewriting
Sort
View
ENTCS
2002
118views more  ENTCS 2002»
13 years 7 months ago
Rank 2 Types for Term Graph Rewriting
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...
Steffen van Bakel
ICLP
2009
Springer
14 years 8 months ago
Demand-Driven Normalisation for ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Leslie De Koninck, Gregory J. Duck, Peter J. Stuck...
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Gregory J. Duck, Peter J. Stuckey, Sebastian Brand
CADE
2001
Springer
14 years 7 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
FSTTCS
2008
Springer
13 years 8 months ago
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Georg Moser, Andreas Schnabl, Johannes Waldmann