LR→2: A laboratory for rapid term graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1631, Issue , 1999, Pages 252-255

  Verma, Rakesh ^a   Senanayake, Shalitha ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957649499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_21     Document Type: Conference Paper

References (5)

1. P. Chew. An improved algorithm for computing with equations. In Proc. IEEE Symp. on Foundations of Computer Science, volume 21, pages 108-117, 1980.
2. M. Hermann, C. Kirchner, and H. Kirchner. Implementations of term rewriting systems. Computer Journal, 34(1):20-33, 1991.
3. Rakesh M. Verma. Smaran: A congruence closure based system for equational computations. In C. Kirchner, ed., Proc. Rewriting Techniques & Applications, 1993.
4. Rakesh M. Verma. A theory of using history for equational systemswith applications. Journal of the ACM, 42(5):984-1020, 1995. Also in IEEE FOCS proc. 1991.
5. Rakesh M. Verma. Static analysis for high-performance rewriting. Technical report, University of Houston, 1997.