Skip to main content
SpringerLink
Log in

Toward the concurrent implementation of computational systems

  • Invited Talk
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1996)

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

Included in the following conference series:

Abstract

This paper places concurrent rewriting in the perspective of supporting the development and use of computational systems. We briefly recall the usefulness of computational systems (i.e. a rewriting theory with strategies) as a logical framework. We then show that the right implementation model for concurrent rewriting allows us to give a meaning to the concurrent rewrite of overlapping redexes. The principles of the implementation of concurrent rewriting and of the associated garbage collection are sketched. We then present a specific transformation of conditional rewriting to unconditional rewriting, that permits us to preserve the potential concurrency of the system as much as possible. This allows us to extend the ReCo system to handle conditional specifications. We finally present experimental results of the system on various parallel architectures.

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. H. Aida, G. Goguen, and J. Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of Lecture Notes in Computer Science, pages 320–332. Springer-Verlag, June 1990.

    Google Scholar 

  2. I. Alouini and C. Kirchner. Conditional concurrent rewriting. Research report 2777, INRIA, Inria Lorraine, March 1996.

    Google Scholar 

  3. I. Alouini. Réécriture concurrente: Etude et implantation. Rapport de DEA, Université Henri Poincaré — Nancy 1, September 1993.

    Google Scholar 

  4. I. Alouini. Concurrent garbage collection for concurrent rewriting. In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of Lecture Notes in Computer Science, pages 132–146. Springer-Verlag, 1995.

    Google Scholar 

  5. A. Beguelin, J. J. Dongarra, and G. A. Geist. Parallel virtual machine user's guide and reference manual. Technical report, Oak Ridge National Laboratory, May 1994.

    Google Scholar 

  6. P. Borovanský, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 5, Asilomar (California), September 1996. Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  7. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 5, Asilomar (California), September 1996. Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  8. P. Borovanský. Implementation of higher-order unification based on calculus of explicit substitutions. In M. Bartošek, J. Staudek, and J. Wiedermann, editors, Proceedings of the SOFSEM'95: Theory and Practice of Informatics, volume 1012 of Lecture Notes in Computer Science, pages 363–368. Springer-Verlag, 1995.

    Google Scholar 

  9. F. Baader and K. U. Schulz. Combination of constraint solving techniques: An algebraic point of view. In J. Hsiang, editor, Rewriting Techniques and Applications, 6th International Conference, RTA-95, LNCS 914, pages 352–366, Kaiserslautern, Germany, April 5–7, 1995. Springer-Verlag.

    Google Scholar 

  10. C. Castro. Solving Binary CSP using Computational Systems. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 5, Asilomar (California), September 1996. Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  11. H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A methodological view of constraint solving, 1995.

    Google Scholar 

  12. H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 9, pages 322–359. The MIT press, Cambridge (MA, USA), 1991.

    Google Scholar 

  13. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions, extended abstract. In D. Kozen, editor, Proceedings of LICS'95, pages 366–374, San Diego, June 1995.

    Google Scholar 

  14. G. Dowek, T. Hardin, C. Kirchner, and F. Pfenning. Unification via explicit substitutions: The case of higher-order patterns. In M. Maher, editor, Proceedings of JICSLP'96, Bonn (Germany), September 1996. The MIT press.

    Google Scholar 

  15. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990.

    Google Scholar 

  16. N. Dershowitz and N. Lindenstrauss. An abstract concurrent machine for rewriting. In Proc. of Algebraic and logic programming, volume 463 of Lecture Notes in Computer Science, pages 318–331. Springer-Verlag, October 1990.

    Google Scholar 

  17. N. Dershowitz and N. Lindenstrauss. Abstract and-parallel machines. Technical report, University of Illinois, September 1995.

    Google Scholar 

  18. N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111–138, 1990.

    Google Scholar 

  19. J. A. Goguen, C. Kirchner, S. Leinwand, J. Meseguer, and T. Winkler. Progress report on the rewrite rule machine. IEEE Computer Architecture Technical Commitee Newsletter, pages 7–21, March 1986.

    Google Scholar 

  20. J. A. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In R. Keller and J. Fasel, editors, Proceedings of Graph Reduction Workshop, volume 279 of Lecture Notes in Computer Science, pages 53–93, Santa Fe (NM, USA), 1987. Springer-Verlag.

    Google Scholar 

  21. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583–628, 1994.

    Google Scholar 

  22. C. Hintermeier. How to transform canonical decreasing ctrss into equivalent canonical trss. In Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems, Jerusalem (Israel), June 1994.

    Google Scholar 

  23. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, chapter 11, pages 395–414. The MIT press, 1991.

    Google Scholar 

  24. B. Hoffmann and D. Plump. Jungle evaluation for efficient term rewriting. In J. Grabowski, P. Lescanne, and W. Wechler, editors, Proceedings 1st International Workshop on Algebraic and Logic Programming, number 343 in Lecture Notes in Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  25. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257–321. The MIT press, Cambridge (MA, USA), 1991.

    Google Scholar 

  26. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue d'Intelligence Artificielle, 4(3):9–52, 1990. Special issue on Automatic Deduction.

    Google Scholar 

  27. C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131–158. The MIT press, 1995.

    Google Scholar 

  28. J. W. Klop and A. Middeldorp. Sequentially in orthogonal term rewriting systems. Journal of Symbolic Computation, 12(2):161–196, August 1991.

    Google Scholar 

  29. H. Kirchner and P.-E. Moreau. Prototyping completion with constraints using computational systems. In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of Lecture Notes in Computer Science, pages 438–443. Springer-Verlag, 1995.

    Google Scholar 

  30. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113–155, 1994.

    Google Scholar 

  31. C. Kirchner and P. Viry. Implementing parallel rewriting. In B. Fronhöfer and G. Wrightson, editors, Parallelization in Inference Systems, volume 590 of Lecture Notes in Artificial Intelligence, pages 123–138. Springer-Verlag, 1992.

    Google Scholar 

  32. J. Meseguer. General logics. In H.-D. E. et al., editor, Logic Colloquium'87, pages 275–329. Elsevier Science Publishers B. V. (North-Holland), 1989.

    Google Scholar 

  33. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.

    Google Scholar 

  34. J. Meseguer. A logical theory of concurrent objects and its realisation in the Maude language. In Agha, Wegner, and Yonezawa, editors, Research Directions in Object-Based Concurrency. The MIT press, 1993.

    Google Scholar 

  35. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proceedings of CONCUR'96, August 1996.

    Google Scholar 

  36. N. Marti-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Technical report, SRI International, 1993.

    Google Scholar 

  37. S. Porat and N. Francez. Fairness in term rewriting systems. Methods of logic in computer science, pages 141–181, 1994.

    Google Scholar 

  38. C. Ringeissen. Combination of matching algorithms. Information and Computation, 1996.

    Google Scholar 

  39. C. Ringeissen. Prototyping combination of unification algorithms with ELAN. Technical report, CRIN, 1996.

    Google Scholar 

  40. P. Viry. La réécriture concurrente. Thèse de Doctorat d'Université, Université Henri Poincaré-Nancy 1, October 1992.

    Google Scholar 

  41. P. Viry. Rewriting: An effective model of concurrency. In Proceedings of PARLE'94, Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  42. M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. Thèse de Doctorat d'Université, Université Henri Poincaré-Nancy 1, October 1994.

    Google Scholar 

  43. M. Vittek. A compiler for nondeterministic term rewriting systems. In Proceedings of RTA '96. Lecture Notes in Computer Science, July 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Lorraine & CRIN, BP 101, 54602, Villers-lès-Nancy, France

    Ilies Alouini & Claude Kirchner

Authors
  1. Ilies Alouini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claude Kirchner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Mario Rodríguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alouini, I., Kirchner, C. (1996). Toward the concurrent implementation of computational systems. In: Hanus, M., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1996. Lecture Notes in Computer Science, vol 1139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61735-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-61735-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61735-8

  • Online ISBN: 978-3-540-70672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation