Skip to main content

Environments for Term Rewriting Engines for Free!

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2003)

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

Included in the following conference series:

Abstract

Term rewriting can only be applied if practical implementations of term rewriting engines exist. New rewriting engines are designed and implemented either to experiment with new (theoretical) results or to be able to tackle new application areas. In this paper we present the Meta-Environment: an environment for rapidly implementing the syntax and semantics of term rewriting based formalisms. We provide not only the basic building blocks, but complete interactive programming environments that only need to be instantiated by the details of a new formalism.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bergstra and P. Klint. The discrete time ToolBus — a software coordination architecture. Science of Computer Programming, 31(2–3):205–229, July 1998.

    Article  MATH  Google Scholar 

  2. S. Blom, W. Fokkink, J. Groote, I. van Langevelde, B. Lisser, and J. van de Pol. μCRL: A toolset for analysing algebraic specifications. In G. Berry, H. Comon, and A. Finkel, editors, CAV 2001, volume 2102 of LNCS, pages 250–254. Springer-Verlag, 2001.

    Google Scholar 

  3. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of ELAN. In C. Kirchner and H. Kirchner, editors, WRLA, volume 15 of ENTCS. Elsevier Sciences, 1998.

    Google Scholar 

  4. M. v. d. Brand, J. Heering, P. Klint, and P. Olivier. Compiling language definitions: The ASF+SDF compiler. ACM Transactions on Programming Languages and Systems, 24(4):334–368, 2002.

    Article  Google Scholar 

  5. M. v. d. Brand, H. d. Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30:259–291, 2000.

    Article  Google Scholar 

  6. M. v. d. Brand, P. Klint, and J. Vinju. Term rewriting with traversal functions. Technical Report SEN-R0121, Centrum voor Wiskunde en Informatica, 2001.

    Google Scholar 

  7. M. v. d. Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation Filters for Scannerless Generalized LR Parsers. In R. N. Horspool, editor, Compiler Construction (CC’02), volume 2304 of LNCS, pages 143–158. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  8. H. Cirstea, C. Kirchner, and L. Liquori. Matching Power. In A. Middeldorp, editor, RTA’01, volume 2051 of LNCS, pages 77–92. Springer-Verlag, 2001.

    Google Scholar 

  9. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, First international workshop on rewriting logic, volume 4, Asilomar (California), 1996. ENTCS.

    Google Scholar 

  10. J. Cordy, C. Halpern-Hamu, and E. Promislow. TXL: A rapid prototyping system for programming language dialects. Computer Languages, 16(1):97–107, 1991.

    Article  Google Scholar 

  11. A. v. Deursen, J. Heering, and P. Klint, editors. Language Prototyping: An Algebraic Specification Approach, volume 5 of AMAST Series in Computing. World Scientific, 1996.

    Google Scholar 

  12. J. Heering and P. Klint. Term Rewriting Systems, chapter 15, pages 787–808. Cambridge University Press, 2003.

    Google Scholar 

  13. H. d. Jong and P. Olivier. Generation of abstract programming interfaces from syntax definitions. Technical Report SEN-R0212, Centrum voor Wiskunde en Informatica (CWI), Aug. 2002.

    Google Scholar 

  14. D. Kapur and H. Zhang. An overview of Rewrite Rule Laboratory (RRL). J. Computer and Mathematics with Applications, 29(2):91–114, 1995.

    Article  MathSciNet  Google Scholar 

  15. S. Lassen, P. Mosses, and D. Watt. An introduction to AN-2, the proposed new version of Action Notation. In Proc. 3rd International Workshop on Action Semantics, volume NS-00-6 of Notes Series, pages 19–36. BRICS, 2000.

    Google Scholar 

  16. P.-E. Moreau, C. Ringeissen, and M. Vittek. A Pattern Matching Compiler for Multiple Target Languages. In G. Hedin, editor, 12th Conference on Compiler Construction, Warsaw (Poland), volume 2622 of LNCS, pages 61–76. Springer-Verlag, May 2003.

    Google Scholar 

  17. J. v. d. Pol. JITty: a Rewriter with Strategy Annotations. In S. Tison, editor, Rewriting Techniques and Applications, volume 2378 of LNCS, pages 367–370. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  18. E. Visser. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In A. Middeldorp, editor, RTA’01, volume 2051 of LNCS, pages 357–361. Springer-Verlag, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van den Brand, M., Moreau, PE., Vinju, J. (2003). Environments for Term Rewriting Engines for Free!. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44881-0_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40254-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics