Sciweavers

Share
500 search results - page 1 / 100
» ACD Term Rewriting
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
10 years 1 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
ICLP
2009
Springer
11 years 2 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...
FSTTCS
2010
Springer
9 years 11 months ago
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
Nicholas Radcliffe, Rakesh M. Verma
FLOPS
2010
Springer
10 years 15 hour ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
MSCS
2007
91views more  MSCS 2007»
10 years 29 days ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
books