Transforming strongly sequential rewrite systems with constructors for efficient parallel execution

  • R. C. Sekar
  • Shaunak Pawagi
  • I. V. Ramakrishnan
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)


Strongly sequential systems, developed by Huet and Levy [2], has formed the basis of equational programming languages. Experience with such languages so far suggests that even complex equational programs are based only on strongly sequential systems with constructors. However, these programs are not readily amenable for efficient parallel execution. This paper introduces a class of strongly sequential systems called path sequential systems. Equational programs based on path sequential systems are more natural for parallel evaluation. An algorithm for transforming any strongly sequential system with constructors into an equivalent path sequential system is described.


Normal Form State Node Function Symbol Sequential System Reduction Sequence 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Hoffman, C. and O'Donnell, M., Programming with Equations, ACM Transactions on Programming Languages and Systems (1982) pp. 83–112.Google Scholar
  2. [2]
    Huet, G. and Levy, J.J., Computations in Nonambiguous Linear Term Rewriting Systems, Tech. Rep. No. 359(1979), INRIA, Le Chesney, France.Google Scholar
  3. [3]
    Klop, J.W. and Middeldorp, A, Strongly Sequential Term Rewriting Systems, Report CS-R8730, Centre for Mathematics and Computer Science, Amsterdam.Google Scholar
  4. [4]
    Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, and Jose Meseguer, Principles of OBJ2, Proc. 12th ACM Symposium on Principles of Programming Languages (1985).Google Scholar
  5. [5]
    O'Donnell, M.J., Term-Rewriting Implementation of Equational Logic Programming, Rewriting Techniques and Applications (1987) pp. 1–12.Google Scholar
  6. [6]
    O'Donnell, M.J., Computing in Systems described by Equations, Springer LNCS 58 (1977).Google Scholar
  7. [7]
    O'Donnell. M.J., Equational Logic as a Programming Language, MIT Press (1985).Google Scholar
  8. [8]
    Joseph Goguen, Claude Kirchner and Jose Meseguer, A Rewrite Rule Machine: Models of Computation for the Rewrite Rule Machine, SRI International, July 1986.Google Scholar
  9. [9]
    Satish Thatte, A Refinement of Strong Sequentiality for Term Rewriting With Constructors, Information and Computing 72(1), 1987.Google Scholar
  10. [10]
    Satish Thatte, On the correspondence between two classes of Reduction systems, Information Processing Letters 20 (2), pp. 83–85 (1985).Google Scholar
  11. [11]
    Shaunak Pawagi, R. Ramesh and I.V. Ramakrishnan, R2M: A Reconfigurable Rewrite Machine, Second International Workshop on Unification, June 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • R. C. Sekar
    • 1
  • Shaunak Pawagi
    • 1
  • I. V. Ramakrishnan
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony Brook

Personalised recommendations