Skip to main content
SpringerLink
Log in

A parallel implementation of rewriting and narrowing

  • System Descriptions
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 355))

Included in the following conference series:

Abstract

A parallel implementation of rewriting and narrowing is described. This implementation is written in Flat Concurrent Prolog, but the ideas involved are applicable to any system where processes are capable of creating other processes and communicating with each other. Using FCP enables one to write very short programs, virtually no longer than the verbal description of the algorithms. Running programs under the FCP interpreter and using facilities provided by it, one can compare the efficiencies of various strategies. Theoretical results about the efficiency of strategies in certain cases are also mentioned.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dershowitz, N. and Plaisted, D.A., Equational Programming, Machine Intelligence 11, eds J.E. Hayes, D. Michie, and J. Richards, pp. 21–56, 1988.

    Google Scholar 

  2. Flajolet, P. and Odlyzko, A., The Average Height of Binary Trees and Other Simple Trees, Journal of Computer and System Sciences 25, pp. 171–213, 1982.

    Google Scholar 

  3. Goguen, J., Kirchner C., and Meseguer, J., Concurrent Term Rewriting as a Model of Computation, SRI-CSL-87-2, 1987.

    Google Scholar 

  4. Hullot, J.-M., Canonical Forms and Unification, 5th Conference on Automated Deduction, Lecture Notes in Computer Science 87, 1980.

    Google Scholar 

  5. Josephson, A. and Dershowitz, N., An Implementation of Narrowing, to appear in the Journal of Logic Programming, 1989.

    Google Scholar 

  6. Réty, P., Improving basic narrowing techniques and commutation properties, Rapports de Recherche No. 681, INRIA, 1987.

    Google Scholar 

  7. Shapiro, E., Concurrent Prolog: A progress report, IEEE Computer, August 1986.

    Google Scholar 

  8. Shapiro, E., Or-Parallel Prolog in Flat Concurrent Prolog, Concurrent Prolog Collected Papers, ed. E. Shapiro, Vol. 2, pp. 415–441, 1987.

    Google Scholar 

  9. Silverman, W., Hirsch, M., Houri A., and Shapiro, E., The Logix System User Manual Version 1.22, Weizmann Institute Technical Report CS87-21, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University, Jerusalem, Israel

    Naomi Lindenstrauss

Authors
  1. Naomi Lindenstrauss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lindenstrauss, N. (1989). A parallel implementation of rewriting and narrowing. 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_140

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_140

  • 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

Publish with us

Policies and ethics

Search

Navigation