Sciweavers

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

66

MFCS
1997
Springer

favoriteEmaildiscussreport

113views Theoretical Computer Science» more MFCS 1997»

Simplification Orders for Term Graph Rewriting

15 years 1 months ago

Simplification Orders for Term Graph Rewriting

Download www-users.cs.york.ac.uk

Detlef Plump

Real-time Traffic

MFCS 1997 | Theoretical Computer Science |

claim paper

Related Content

» Term ordering problem on MDG

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

» Approximating Dependency Graphs Using Tree Automata Techniques

» Automating the Dependency Pair Method

» Automated Termination Proofs for Java Programs with Cyclic Data

» Adjunction for Garbage Collection with Application to Graph Rewriting

» Linearized Terrain Languages for Silhouette Representations

» Set functions for functional logic programming

» Scalable query rewriting a graphbased approach

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	MFCS
Authors	Detlef Plump

Comments (0)