Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2006
Springer

favoriteEmaildiscussreport

132views Education» more CORR 2006»

ACD Term Rewriting

13 years 4 months ago

ACD Term Rewriting

Download ww2.cs.mu.oz.au

ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implementation for ACDTR based on bottom-up eager normalisation, extended to support the conjunctive context. This paper investigates the possibility of using a demand-driven normalisation strategy for ACDTR. Again, dealing with the conjunctive context proves to be challenging. The alternative normalisation strategy is compared with the current form of eager normalisation and potential further improvements on the strategy are investigated.

Gregory J. Duck, Peter J. Stuckey, Sebastian Brand

Real-time Traffic

Bottom-up Eager Normalisation | Conjunctive Context | CORR 2006 | Eager Normalisation | Education |

claim paper

Related Content

» DemandDriven Normalisation for ACD Term Rewriting

» Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

» Proving Injectivity of Functions via Program Inversion in Term Rewriting

» A rewriting calculus for cyclic higherorder term graphs

» Rewriting in the partial algebra of typed terms modulo AC

» Rank 2 Types for Term Graph Rewriting

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Cdiprover3 A Tool for Proving Derivational Complexities of Term Rewriting Systems

» Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Gregory J. Duck, Peter J. Stuckey, Sebastian Brand

Comments (0)