Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1999: Rewriting Techniques and Applications pp 252–255Cite as

\( \overrightarrow {LR} ^2 \) : A Laboratory for Rapid Term Graph Rewriting

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1631))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. M. Hermann, C. Kirchner, and H. Kirchner. Implementations of term rewriting systems. Computer Journal, 34(1):20–33, 1991.

    Article  MathSciNet  Google Scholar 

  3. Rakesh M. Verma. Smaran: A congruence closure based system for equational computations. In C. Kirchner, ed., Proc. Rewriting Techniques & Applications, 1993.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  5. Rakesh M. Verma. Static analysis for high-performance rewriting. Technical report, University of Houston, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Houston, Houston, TX, 77204

    Rakesh Verma & Shalitha Senanayake

Authors
  1. Rakesh Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shalitha Senanayake
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verma, R., Senanayake, S. (1999). \( \overrightarrow {LR} ^2 \) : A Laboratory for Rapid Term Graph Rewriting. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

  • Online ISBN: 978-3-540-48685-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation