论文信息 - LarrowR2: A Laboratory fro Rapid Term Graph Rewriting

LarrowR2: A Laboratory fro Rapid Term Graph Rewriting

In this system description, we present the current state of LR 2 , a laboratory for developing and evaluating fast, efficient and practical rewriting techniques. We include a brief description of the main algorithm for storing history, selected optimizations, and some performance results and comparisons with related systems. We conclude with some promising directions for future research.

Rakesh M. Verma | Shalitha Senanayake

[1] Rakesh M. Verma. Smaran: A Congruence-Closure Based System for Equational Computations , 1993, RTA.

[2] Claude Kirchner,et al. Implementations of Term Rewriting Systems , 1991, Comput. J..

[3] Paul Chew,et al. An improved algorithm for computing with equations , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4] Robert E. Shostak,et al. Deciding Combinations of Theories , 1982, JACM.

[5] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.

[6] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.

[7] Rakesh M. Verma. A theory of using history for equational systems with applications , 1995, JACM.

[8] Derek C. Oppen,et al. Fast decision algorithms based on congruence closure , 1978 .

[9] Rakesh Mohan Verma. Ubiquitous equations, nonoblivious normalization and term =matching problems , 1989 .