Skip to main content
SpringerLink
Log in

Rewriting as a unified model of concurrency

  • Selected Presentations
  • Conference paper
  • First Online:
Book cover CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

Supported by Office of Naval Research Contracts N00014-90-C-0086, N00014-88-C-0618 and N00014-86-C-0450, and NSF Grant CCR-8707155.

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. G. Agha. Actors. MIT Press, 1986.

    Google Scholar 

  2. M. Barr and C. Wells. Toposes, Triples and Theories. Springer-Verlag, 1985.

    Google Scholar 

  3. Gérard Berry and Gérard Boudol. The Chemical Abstract Machine. In Proc. POPL'90, pages 81–94. ACM, 1990.

    Google Scholar 

  4. K. Many Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B. North-Holland, 1990.

    Google Scholar 

  6. J. Engelfriet. Net-based description of parallel object-based systems, or POTs and POPs. Technical report, Noordwijkerhout FOOL Workshop, May 1990.

    Google Scholar 

  7. J. Engelfriet, G. Leih, and G. Rozenberg. Parallel object-based systems and Petri nets, I and II. Technical Report 90-04-5, Dept. of Computer Science, University of Leiden, February 1990.

    Google Scholar 

  8. Jean-Yves Girard. Towards a geometry of interaction. In J.W. Gray and A. Scedrov, editors, Proc. AMS Summer Research Conference on Categories in Computer Science and Logic, Boulder, Colorado, June 1987, pages 69–108. American Mathematical Society, 1989.

    Google Scholar 

  9. J.A. Goguen and J. Meseguer. Software for the rewrite rule machine. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pages 628–637. ICOT, 1988.

    Google Scholar 

  10. Joseph Goguen, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis, José Meseguer, and Timothy Winkler. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, Orsay, France, July 8–10, 1987, pages 258–263. Springer-Verlag, Lecture Notes in Computer Science No. 308, 1988.

    Google Scholar 

  11. Joseph Goguen and José Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417–477. MIT Press, 1987. Preliminary version in SIGPLAN Notices, Volume 21, Number 10, pages 153–162, October 1986; also, Technical Report CSLI-87-93, Center for the Study of Language and Information, Stanford University, March 1987.

    Google Scholar 

  12. Joseph Goguen and José Meseguer. Order-sorted algebra I: Partial and overloaded operations, errors and inheritance. Technical Report SRI-CSL-89-10, SRI International, Computer Science Lab, July 1989. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983. Submitted for publication.

    Google Scholar 

  13. Joseph Goguen, José Meseguer, Sany Leinwand, Timothy Winkler, and Hitoshi Aida. The rewrite rule machine. Technical Report SRI-CSL-89-6, SRI International, Computer Science Lab, March 1989.

    Google Scholar 

  14. Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24(1):68–95, January 1977.

    Google Scholar 

  15. Joseph A. Goguen, Claude Kirchner, and José Meseguer. Concurrent term rewriting as a model of computation. In R. Keller and J. Fasel, editors, Proc. Workshop on Graph Reduction, Santa Fe, New Mexico, pages 53–93. Springer LNCS 279, 1987.

    Google Scholar 

  16. G. Huet. Formal Structures for Computation and Deduction. INRIA, 1986.

    Google Scholar 

  17. Gerard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing Machinery, 27:797–821, 1980. Preliminary version in 18th Symposium on Mathematical Foundations of Computer Science, 1977.

    Google Scholar 

  18. Joachim Lambek. Deductive systems and categories II. In Category Theory, Homology Theory and their Applications I. Springer Lecture Notes in Mathematics No. 86, 1969.

    Google Scholar 

  19. F.W. Lawvere. Adjointness in foundations. Dialectica, 23(3/4):281–296, 1969.

    Google Scholar 

  20. Saunders MacLane. Categories for the working mathematician. Springer, 1971.

    Google Scholar 

  21. Narciso Martí-Oliet and José Meseguer. An algebraic axiomatization of linear logic models. Technical Report SRI-CSL-89-11, SRI International, Computer Science Lab, December 1989. To appear in G.M. Reed, A.W. Roscoe and R. Wachter (eds.), Proceedings of the Oxford Symposium on Topology in Computer Science, Oxford University Press, 1990.

    Google Scholar 

  22. Narciso Martí-Oliet and José Meseguer. From Petri nets to linear logic. In D.H. Pitt et al., editor, Category Theory and Computer Science, pages 313–340. Springer Lecture Notes in Computer Science, Vol. 389, 1989. Full version to appear in Mathematical Structures in Computer Science.

    Google Scholar 

  23. José Meseguer. General logics. In H.-D. Ebbinghaus et al., editor, Logic Colloquium'87, pages 275–329. North-Holland, 1989.

    Google Scholar 

  24. José Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA'90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990. ACM, 1990.

    Google Scholar 

  25. José Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.

    Google Scholar 

  26. José Meseguer and Ugo Montanari. Petri nets are monoids. Technical report, SRI International, Computer Science Laboratory, January 1988. Revised June 1989; to appear in Information and Computation.

    Google Scholar 

  27. José Meseguer and Ugo Montanari. Petri nets are monoids: A new algebraic foundation for net theory. In Proc. LICS'88, pages 155–164. IEEE, 1988.

    Google Scholar 

  28. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  29. A. Pitts. An elementary calculus of approximations. Unpublished manuscript, University of Sussex, December 1987.

    Google Scholar 

  30. D.E. Rydeheard and J.G. Stell. Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms. In Proceedings of the Summer Conference on Category Theory and Computer Science, Edinburgh, Sept. 1987. Springer LNCS 283, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International, 94025, Menlo Park, CA

    José Meseguer

  2. Center for the Study of Language and Information, Stanford University, 94305, Stanford, CA

    José Meseguer

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meseguer, J. (1990). Rewriting as a unified model of concurrency. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039072

Download citation

  • DOI: https://doi.org/10.1007/BFb0039072

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation