Advertisement

Structured contextual rewriting

  • Qian Zhenyu
Confluence
Part of the Lecture Notes in Computer Science book series (LNCS, volume 256)

Abstract

In this paper, we develop a mechanism, which we call structured contextual system, (SCS for short,) to deal with some non-finitely-based algebraic specifications. The sufficient condition for confluence and termination of this kind of systems is also considered, based on a generalization of the approach by O'Donell.

Keywords

Ground Rule Ground Term Ground Instance Rewrite System Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

8. References

  1. [ADJ 78]
    Goguen,J.A., Thatcher,J.W., Wagner,E.G.: "An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types" in: Current Trends in Programming Methodology, Vol. IV (ed. Yeh.R.T.), Prentice Hall, 1978.Google Scholar
  2. [BG 79]
    Burstall,R.M., Goguen,J.A., "The Semantics of Clear, a Specification Language" In: Proc. of the 1979 Copenhagen Winter School on Abstract Software Specification, LNCS Vol. 86, Springer-Verlag, 1980.Google Scholar
  3. [BaWö 82]
    Bauer,F.L.,Wössner,H., "Algorithmic Language and Program Development" Springer-Verlag 1982Google Scholar
  4. [BMR 86]
    Badt,P., Möncke,U. and Raber,P., "Specification of Recursive Patterns" PROSPECTRA Research Report S.1.6_SN_4.0, March, 1986Google Scholar
  5. [CIP-L]
    Bauer,F.L., Broy,M., Dosch,W., Geiselbrechtinger,F., Hesse,W., Gratz,R., Krieg-Brückner,B., Laut,A., Matzner,T., Möller,B., Nickl,F., Partsch,H., Pepper,P.,Samelson,K., Wirsing,M., Wössner,H., "The Munich Project CIP. Volume I: The Wide Spectrum Language CIP-L" LNCS 183, Springer 1985Google Scholar
  6. [De 83]
    Dershowitz,N., "Applications for the Knuth-Bendix Completion Procedure". Aerospace Report No. atr-83(8478)-2, Lab. Operations, The Aerospace Corporation, 1983Google Scholar
  7. [De 85]
    Dershowitz,N., "Computing with Rewrite Systems", in: Information and Control Vol.65, No.2/3, May/June 1985Google Scholar
  8. [DMT 85]
    Dershowitz,N., Marcus,L. and Tarlecki,A., "Existence, Uniqueness, and Construction of Rewrite Systems" Aerospace Report No. atr-85(8354)-7, Lab. Operations, The Aerospace Corporation, 1985Google Scholar
  9. [HO 80]
    Huet, G., Oppen, D.C., "Equations and Rewrite Rules: A Survey" in: Formal Language Theory: Perspectives and Open Problems (ed. Book, R.), Academic Press, New York, 1980Google Scholar
  10. [JHW 86]
    Jähnichen,S., Hussain,F.A., Weber,M., "Program Development Using a Design Calculus", Proceeding of the ESPRIT Technical Week, 1986.Google Scholar
  11. [Ka 83]
    Kaplan,S. "Conditional Term Rewrite Systems" Report No.150, LRI-Orsay, France 1983. Revised Version in: Theo. Comp. Sci. Vol.33, 1984Google Scholar
  12. [K-B 86]
    Krieg-Brückner,B., "Informal Specification of TrafoLa" PROSPECTRA Research Report M.1.1.S1-SN-10.0, Bremen, March, 1986.Google Scholar
  13. [Kre 86]
    Kreowski, H.-J., "Partial Algebras Flow From Algebraic Specification", draft version, FB Mathematik/Informatik, Univ. of Bremen, Feb. 1986.Google Scholar
  14. [MW 85]
    Manna,Z., Waldinger,R.: "The Logic Basis for Computer Programming Vol. 1: Deductive Reasoning", Addison-Wesley Publishing Company, Inc., 1985Google Scholar
  15. [O'D 77]
    O'Donell,M.J., "Computing in Systems Described by Equations" LNCS 58, Springer-Verlag 1977Google Scholar
  16. [O'D 85]
    O'Donell,M.J., "Equational Logic as a Programming Language", MIT Press Series in the Foundations of Computing, Cambridge,Massachusetts, London,England, 1985Google Scholar
  17. [Pe 84]
    Pepper,P., "A Simple Calculus for Program Transformations (Inclusive of Induction)", Research Report TUM-18409, Technical Univ. of Munich, July 1984Google Scholar
  18. [PROSPECTRA]
    Krieg-Brückner,B., Ganzinger,H., Broy,M., Wilhelm,R., McGettrick,A.M., Campbell,I.G., Winterstein,G., "PROgram development by SPECification and TRAnsformation, Project Summary." Univ. of Bremen, 1985Google Scholar
  19. [Qi 86a]
    Qian,Zh., "Recursive Presentation of Program Transformation" PROSPECTRA Study Notes M.1.1.S1-SN-17.1, Univ. of Bremen, Sept. 1986Google Scholar
  20. [Qi 86b]
    Qian,Zh., "An Example of Recursively Presented Transformation" PROSPECTRA Study Notes M.1.1.S1-SN-21.0, Univ. of Bremen, Nov. 1986Google Scholar
  21. [Qi 86c]
    Qian,Zh., "Sufficient Condition for Confluent and Terminating Term Rewrite System and its Extension to Recursively Presented Term Rewriting" PROSPECTRA Study Notes M.1.1.S1-SN-16.2, Univ. of Bremen, Nov. 1986Google Scholar
  22. [Ta 79]
    Talor,W., "Equational Logic" in: Universal Algebra" (ed. Gratzer,G.), second edition, Springer-Verlag 1979Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Qian Zhenyu
    • 1
  1. 1.FB 3 Mathematik/InformatikUniversity of BremenBremen 33Germany

Personalised recommendations