Abstract
Term rewriting corresponds to reduction in applicative languages; narrowing of terms corresponds to goal reduction in logic languages. An abstract machine is described for rewriting and narrowing. It has been implemented in Flat Concurrent Prolog, but could be coded in any system in which processes are capable of creating other processes and communicating with each other.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Dershowitz and J.-P. Jouannaud, “Rewrite systems”, Chap. 6 in J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. 2, North-Holland, 1990.
N. Dershowitz and N. Lindenstrauss, “Average time analyses related to logic programming”, Logic Programming: Proceedings of the 6th International Conference, MIT Press, pp. 369–381, 1989.
N. Dershowitz and N. Lindenstrauss, “A parallel implementation of equational programming”, Proceedings of the 5th Jerusalem Conference on Information Technology, Oct. 1990, to appear.
N. Dershowitz and D. A. Plaisted, “Equational programming”, in J. E. Hayes, D. Michie, and J. Richards, eds., Machine Intelligence 11, pp. 21–56, 1988.
J. Goguen, C. Kirchner, and J. Meseguer, “Concurrent term rewriting as a model of computation”, Proceedings of a Workshop on Graph Reduction, Santa Fé, NM, Lecture Notes in Computer Science 279, Springer, Berlin, pp. 53–93, 1986.
N. A. Josephson and N. Dershowitz, “An implementation of narrowing”, Journal of Logic Programming 6(1&2), pp. 57–77, 1989.
W. Küchlin, “Some reduction strategies for algebraic term rewriting”, ACM SIGSAM Bull. 16(4), pp. 13–23, 1982.
D. W. Jones, “Concurrent operations on priority queues”, Communications of the ACM 32, pp. 132–137, 1989.
K. Li, “Complexity of Term Rewriting”, Technical Report 464, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, NY, November 1989.
Shapiro, E., “Systolic programming: A paradigm of parallel processing”, in E. Shapiro, ed., Concurrent Prolog Collected Papers, Vol. 1, pp. 207–242, 1987.
R. C. Sekar, S. Pagawi, and I. V. Ramakrishnan, “Transforming strongly sequential rewrite systems with constructors for efficient parallel execution”, Rewriting Techniques and Applications: 3rd International Conference, Lecture Notes in Computer Science 355, pp. 404–418, 1989.
D. D. Sleator and R. E. Tarjan, “Self-adjusting heaps”, SIAM J. Comput. 15, pp. 52–69, 1986.
M. E. Stickel, “A note on leftmost innermost term reduction”, ACM SIGSAM Bull. 17(3&4), pp. 19–20, 1983.
H. Tamaki and T. Sato, “Program Transformation Through Meta-shifting”, New Generation Computing 1, pp. 93–98, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dershowitz, N., Lindenstrauss, N. (1990). An abstract concurrent machine for rewriting. In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_48
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive