Skip to main content
SpringerLink
Log in

REM (Reduce Elan Machine): Core of the New ELAN Compiler

  • Conference paper
Rewriting Techniques and Applications (RTA 2000)

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

Included in the following conference series:

Abstract

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. It offers a natural and simple logical framework for the combination of the computation and deduction paradigms. It supports the design of theorem provers, logic programming languages, constraint solvers and decision procedures.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C.: An overview of ELAN. In: Proceedings of the 2nd InternationalWorkshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 15 (1998)

    Google Scholar 

  2. Kirchner, H., Moreau, P.-E.: Non-deterministic computations in ELAN. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 168–182. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Klint, P.: A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology 2, 176–201 (1993)

    Article  Google Scholar 

  4. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Moreau, P.-E., Kirchner, H.: A compiler for rewrite programs in associativecommutative theories. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol. 1490, pp. 230–249. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA & Bouygues Telecom, France

    Pierre-Etienne Moreau

Authors
  1. Pierre-Etienne Moreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Stony Brook University, Stony Brook, P.O. Box, New York

    Leo Bachmair

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moreau, PE. (2000). REM (Reduce Elan Machine): Core of the New ELAN Compiler. In: Bachmair, L. (eds) Rewriting Techniques and Applications. RTA 2000. Lecture Notes in Computer Science, vol 1833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721975_19

Download citation

  • DOI: https://doi.org/10.1007/10721975_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67778-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation