Advertisement

REVE a rewrite rule laboratory

  • Pierre Leschanne
Systems Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 247)

6-References

  1. [FOR,84]
    R. FORGAARD, ”A program for generating and analyzing term rewriting system”, Master of science in computer science MIT 1984. Jouannaud KirchnerGoogle Scholar
  2. [C-J,85]
    C. CHOPPY, C. JOHNEN ”Pretrireve: Proving Petri Net Properties With Rewriting Systems”, Proc. 1st Conference on Rewriting Techniques and Applications, Dijon (France), Lecture Notes in Computer Science vol. 202, Springer Verlag, pp. 271–286, 1985.Google Scholar
  3. [C-K,85]
    S.S. COSMADAKIS, P.C. KANELLAKIS, ”Two Applications of Equational Theories to Data base Theory”, Proc. 1st Conference on Rewriting Techniques and Applications, Dijon (France), Lecture Notes in Computer Science vol. 202, Springer Verlag, pp. 107–123, 1985.Google Scholar
  4. [J-K,84]
    J.P. JOUANNAUD, H. KIRCHNER, ”Completion of a set of rules modulo a set of equations”, Proceedings 11th ACM Conference of Principles of Programming Languages, Salt Lake City (Utah, USA), 1984.Google Scholar
  5. [K-K,85]
    C. KIRCHNER & H. KIRCHNER, ”Implementation of a general completion procedure parameterized by built-in theories and strategies”, Proceedings of the EUROCAL 85 conference, 1985.Google Scholar
  6. [LES,83]
    P. LESCANNE ”Computer Experiments with the REVE Term Rewriting System Generator” 10th POPL, Austin, Texas, January 1983, pp 99–108Google Scholar
  7. [R-Z,84]
    J.L. REMY, H. ZHANG, ”REVEUR 4: a System for Validating Conditional Algebraic Specifications of Abstract Data Types” Proceedings of the 5th ECAI Pisa, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Pierre Leschanne
    • 1
  1. 1.Centre de Recherche en Informatique de NancyVandoeuvre CedexFrance

Personalised recommendations