Semantics and strong sequentially of priority term rewriting systems

  • Masahiko Sakai
  • Yoshihito Toyama
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1103)

Abstract

This paper gives an operational semantics of priority term rewriting systems (PRS) by using conditional systems, whose reduction is decidable and stable under substitution. We also define the class of strong sequential PRSs and show that this class is decidable. Moreover, we show that the index rewriting of strong sequential PRSs gives a normalizing strategy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBKW89]
    J. C. M. Baeten, J. A. Bergstra, J. W. Klop, and W. P. Weijland. Term rewriting systems with rule priorities. Theoretical Computer Science, 67:283–301, 1989.CrossRefGoogle Scholar
  2. [Com95]
    H. Comon. Sequentiality, second order monadic logic and tree automata. In Logic in Computer Science, pages 508–517, 1995.Google Scholar
  3. [DJ90]
    N. Dershouwitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–320. North-Holland, 1990.Google Scholar
  4. [Hen80]
    P. Henderson. Functional Programming. Prentice Hall International, 1980.Google Scholar
  5. [HL79]
    G. Huet and J.-J. Lévy. Call by need computations in non-ambiguous linear term rewriting systems. Technical Report 359, INRIA, 1979.Google Scholar
  6. [Hue80]
    G. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of Association for Computing Machinery, 27(4):797–21, October 1980.Google Scholar
  7. [Jon87]
    S. L. P. Jones. The Implementation of Functional Programming Languages. Prentice Hall International, 1987.Google Scholar
  8. [Klo92]
    J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I. Oxford University Press, 1992.Google Scholar
  9. [KM91]
    J. W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewritng systems. J. Symbolic Computation, 12:161–195, 1991.Google Scholar
  10. [Moh89]
    C. K. Mohan. Priority rewriting: Semantics, confluence, and conditionals. In LNCS, volume 355, pages 278–291. Springer-Verlag, 1989.Google Scholar
  11. [PvE93]
    R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-wesley, 1993.Google Scholar
  12. [Rab77]
    M. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595–629. North-Holland, 1977.Google Scholar
  13. [Tho90]
    W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134–191. Elsevier, 1990.Google Scholar
  14. [Toy92]
    Y. Toyama. Strong sequentiality of left-linear overlapping term rewriting systems. In Proc. of the 7'th annual IEEE Symposium on Login in Computer Science, pages 274–284, 1992.Google Scholar
  15. [TSvEP93]
    Y. Toyama, S. Smetsers, M. van Eekelen, and R. Plasmeijer. The Functional Strategy and Transitive Term Rewriting Systems. In Ronan Sleep, Rinus Plasmeijer, and Marko van Eelkelen, editors, Term Graph Rewriting: Theory and Practice, pages 61–75. John Wiley & Sons Ltd, 1993.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Masahiko Sakai
    • 1
  • Yoshihito Toyama
    • 1
  1. 1.Japan Advanced Institute of Science and TechnologyIshikawaJapan

Personalised recommendations