Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1985: Rewriting Techniques and Applications pp 46–62Cite as

Contextual rewriting

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

10. Reference

  1. Bergstra J.A., Broy M., Tucker J.V. and Wirsing M. On the power of algebraic specifications, 10th MFCS, LNCS 218, Springer Verlag, Berlin, pp 193–202, 1981

    Google Scholar 

  2. Bergstra J. and Klop J. Conditional rewrite rules: confluency and termination, Report IW 198/82, Amsterdam, 1982.

    Google Scholar 

  3. Brand D., Darringer J.A., Joyner W.H. Completeness of conditional reductions, Research report RC 7404 IBM, 1978

    Google Scholar 

  4. Dershowvitz N., Computing with Rewrite systems, Proc. of NSF, Workshop on the RRL, Report No. 84 GENOO8 April 1984.

    Google Scholar 

  5. Drosten K. Toward executable specifications unsing conditional axioms, Report 83-01, t.U. Braunschweig, 1983. A.C.M. 29, pp 206–227, 1982

    Google Scholar 

  6. Forgaard R. and Guttag J.V. REVE: a term rewriting system generator with failure-resistant knuth-Bendix, Laboratory for computer science MIT 1984.

    Google Scholar 

  7. Guttag J.V., Horowitz R., Musser D.R. The design of data type specifications, Current Trends in Programming Methodology, Vol. IV. R. Yeh, (Ed.), Prentice Hall (1978)

    Google Scholar 

  8. Goguen J.A. How to prove algebraic inductive hypotheses without induction, with applications to the correctness of data type implementation, Proc. the Workshop on Automated deduction, Les Arcs, 1980

    Google Scholar 

  9. Goguen J.A., Thatcher J.W. and Wagner E.G., An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types, "Current Trends in Programming Methodology", Vol 4, Ed. Yeh R, Prentice-Hall, pp. 80–149, 1978

    Google Scholar 

  10. Hsiang J. Refutational theorem proving using term rewriting systems, Res. Report, Dept of Comp. Sc, U. of Illinois, Urbana, 1981

    Google Scholar 

  11. Huet G. A complete proof of correctness of the Knuth-Bendix completion algorithm J.C.S.S. 231 11–21 1981.

    Google Scholar 

  12. Huet G. and Oppen D., Equations and rewrite rules: a survey, in formal languages: perspectives and open problems, Ed. Book R, Academic Press, 1980

    Google Scholar 

  13. Kaplan S. Un langage de specification de types abstraits algebrique, These de 3eme cycle, Orsay, 1983.

    Google Scholar 

  14. Kaplan S. Fair conditional term rewriting systems: unification, termination and confluence, Manuscript, LRI, Orsay, 1984.

    Google Scholar 

  15. Knuth D. and Bendix P. Simple word problems in universal algebras, in computational problems in abstract algebra, Ed. Leech J, Pergamon Press, pp. 263–297, 1970

    Google Scholar 

  16. Lankford D.S. Some new approaches to the theory and applications of conditional term rewriting systems, report MTP-6, math. Dept, Lousiana Tech. U, Aug. 1979

    Google Scholar 

  17. Lescanne P. Computer experiments with the REVE term rewriting system generator, 1983, Proceedings 10th ACM symposium principles of programming languages, Austin (Texas, USA)

    Google Scholar 

  18. D. L. Musser On Proving Inductive Properties of Abstract Data Types, Proceedings of the 7th Annual Acm Symposium on Principles of Programming Languages, Las Vegas, P. 154–162, 1980

    Google Scholar 

  19. Navarro M. and Orejas F. On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems, Eurosam 84, Oxford.

    Google Scholar 

  20. Pletat U., Engels G., Ehrich H.D., Operational semantics of algebraic specifications with conditional equations, 7eme CAAP, (Lille), L.N.C.S. Springer Verlag 1982

    Google Scholar 

  21. Remy J.L. Etudes des systems reecriture conditionnelles et applications aux types abstraits algebriques, These d'etat, Universite NANCY 1, 1982

    Google Scholar 

  22. Remy J.L. Proving conditional identities by equational case reasoning rewriting and normalization, 1983, Actes seminaire laboratoire informatique theorique de Paris.

    Google Scholar 

  23. Remy J.L., Zhang H. REVEUR 4: a system for validating conditional algebraic specifications of abstract data types, Proce of 6th ECAI, Pisa, pp. 563–572 (1984)

    Google Scholar 

  24. Zhang H., REVEUR4: L'etude et la mise en oevre de la reecriture conditionnelle." These de 3eme cycle, University of NANCY 1 (1984).

    Google Scholar 

Download references

Author information

Author notes

  1. Hantao Zhang

    Present address: Department of Computer Science, Rensselaer Polytechnic Institute, 12181, Troy, NY, USA

Authors and Affiliations

  1. Centre de Recherche en Informatique de Nancy, Campus Scientifique, BP239, 54506, Vandoeuvre, France

    Hantao Zhang & Jean-Luc Remy

Authors
  1. Hantao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Luc Remy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Remy, JL. (1985). Contextual rewriting. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-15976-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15976-6

  • Online ISBN: 978-3-540-39679-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation