Abstract
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.
Partially supported by NSF grant CCR-8805734
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hoffman, C. and O'Donnell, M., Programming with Equations, ACM Transactions on Programming Languages and Systems (1982) pp. 83–112.
Huet, G. and Levy, J.J., Computations in Nonambiguous Linear Term Rewriting Systems, Tech. Rep. No. 359(1979), INRIA, Le Chesney, France.
Klop, J.W. and Middeldorp, A, Strongly Sequential Term Rewriting Systems, Report CS-R8730, Centre for Mathematics and Computer Science, Amsterdam.
Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, and Jose Meseguer, Principles of OBJ2, Proc. 12th ACM Symposium on Principles of Programming Languages (1985).
O'Donnell, M.J., Term-Rewriting Implementation of Equational Logic Programming, Rewriting Techniques and Applications (1987) pp. 1–12.
O'Donnell, M.J., Computing in Systems described by Equations, Springer LNCS 58 (1977).
O'Donnell. M.J., Equational Logic as a Programming Language, MIT Press (1985).
Joseph Goguen, Claude Kirchner and Jose Meseguer, A Rewrite Rule Machine: Models of Computation for the Rewrite Rule Machine, SRI International, July 1986.
Satish Thatte, A Refinement of Strong Sequentiality for Term Rewriting With Constructors, Information and Computing 72(1), 1987.
Satish Thatte, On the correspondence between two classes of Reduction systems, Information Processing Letters 20 (2), pp. 83–85 (1985).
Shaunak Pawagi, R. Ramesh and I.V. Ramakrishnan, R2M: A Reconfigurable Rewrite Machine, Second International Workshop on Unification, June 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sekar, R.C., Pawagi, S., Ramakrishnan, I.V. (1989). Transforming strongly sequential rewrite systems with constructors for efficient parallel execution. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_122
Download citation
DOI: https://doi.org/10.1007/3-540-51081-8_122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51081-9
Online ISBN: 978-3-540-46149-4
eBook Packages: Springer Book Archive