Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit Substitution. In Proc. POPL'90, pages 31–46. ACM, 1990.
G. Agha. Actors. MIT Press, 1986.
G. Agha and C. Hewitt. Concurrent programming using actors. In A. Yonezawa and M. Tokoro, editors, Object-Oriented Concurrent Programming. MIT Press, 1988.
H. Aida, J. Goguen, S. Leinwand, P. Lincoln, J. Meseguer, B. Taheri, and T. Winkler. Simulation and performance estimation for the rewrite rule machine. Submitted for publication, 1991.
Hitoshi Aida, Joseph Goguen, and José Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In S. Kaplan and M. Okada, editors, Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990, pages 320–332. Springer LNCS 516, 1991.
Hitoshi Aida, Sany Leinwand, and José Meseguer. Architectural design of the rewrite rule machine ensemble. To appear in J. Delgado-Frias and W.R. More, editors, Proc. Workshop on VLSI for Artificial Intelligence and Neural Networks, Oxford, September 1990; also, Tech. Report SRI-.CSL-90-17, December 1990.
Jean-Marc Andreoli and Remo Pareschi. LO and behold! Concurrent structured processes. In ECOOP-OOPSLA'90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 44–56. ACM, 1990.
J.-P. Banâtre, A. Coutant, and D. Le Mètayer. Parallel machines for multiset transformation and their programming style. Informationstechnik, 30(2):99–109, 1988.
J.-P. Banâtre and D. Le Mètayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55–77, 1990.
M. Barr and C. Wells. Toposes, Triples and Theories. Springer-Verlag, 1985.
Gérard Berry and Gérard Boudol. The Chemical Abstract Machine. In Proc. POPL'90, pages 81–94. ACM, 1990.
N. Carriero and D. Gelernter. Linda in context. Communications of the Association for Computing Machinery, 32:444–458, April 1989.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
K. Mani Chandy and Stephen Taylor. An Introduction to Parallel Programming. Addison-Wesley, 1991.
Will Clinger. Foundations of actor semantics. Technical report AI-TR-633, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, 1981.
Andrea Corradini and Ugo Montanari. An algebraic semantics of logic programs as structured transition systems. In S. Debray and M. Hermenegildo, editors, North American Conference on Logic Programming, pages 788–812. MIT Press, 1990.
William Dally. Network and processor architecture for message-driven computers. In R. Suaya and G. Birtwistle, editors, VLSI and Parallel Computation, pages 140–222. Morgan Kaufmann, 1990.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243–320. North-Holland, 1990.
J. Engelfriet, G. Leih, and G. Rozenberg. Parallel object-based systems and Petri nets, I and II. Technical Report 90-04,90-05, Dept. of Computer Science, University of Leiden, February 1990.
J. Engelfriet, G. Leih, and G. Rozenberg. Net-based description of parallel object-based systems, or POTs and POPs. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, Noordwijkerhout, The Netherlands, May/June 1990, pages 229–273. Springer LNCS 489, 1991.
Ian Foster and Stephen Taylor. Strand: new concepts in parallel programming. Prentice Hall, 1990.
J.A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. Technical report, Computer Science Lab, SRI International, 1991. To appear in J.A. Goguen, D. Coleman and R. Gallimore, editors, Applications of Algebraic Specification Using OBJ, Cambridge University Press.
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 LNCS 308, 1988.
Joseph 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.
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.
Joseph Goguen and José 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.
Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. 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.
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.
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.
HOT Chips II. IEEE, 1990. Record of Symposium held at Santa Clara University August 20–21, 1990.
Paul Hudak and Eric Mohr. Graphinators and the duality of SIMD and MIMD. In ACM Symposium on Lisp and Functional Programming, pages 224–234. ACM, 1988.
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.
R. Jagannathan and A.A. Faustini. The GLU programming language. Technical Report SRI-CSL-90-11, SRI International, Computer Science Laboratory, November 1990.
Simon S. Lam and A. Udaya Shankar. A relational notation for state transition systems. IEEE Transactions on Software Engineering, SE-16(7):755–775, July 1990.
Saunders MacLane. Categories for the working mathematician. Springer-Verlag, 1971.
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 LNCS 389, 1989. Final version in Mathematical Structures in Computer Science, 1:69–101, 1991.
Narciso Martí-Oliet and José Meseguer. An algebraic axiomatization of linear logic models. In G.M. Reed, A.W. Roscoe, and R. Wachter, editors, Topology and Category Theory in Computer Science, pages 335–355. Oxford University Press, 1991. Also Technical Report SRI-CSL-89-11, SRI International, Computer Science Lab, December 1989.
Satoshi Matsuoka, Ken Wakita, and Akinori Yonezawa. Inheritance anomaly in objectoriented concurrent programming languages. Dept. of Information Science, University of Tokyo, January 1991.
José Meseguer. General logics. In H.-D. Ebbinghaus et al., editor, Logic Colloquium'87, pages 275–329. North-Holland, 1989.
José Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA'90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 101–115. ACM, 1990.
José Meseguer. Rewriting as a unified model of concurrency. In Proceedings of the Concur'90 Conference, Amsterdam, August 1990, pages 384–400. Springer LNCS 458, 1990.
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.
José Meseguer. Conditional rewriting logic as a unified model of concurrency. Technical Report SRI-CSL-91-05, SRI International, Computer Science Laboratory, February 1991. To appear in Theoretical Computer Science, 94, 1992.
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.
José Meseguer and Ugo Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990. Appeared as SRI Tech Report SRI-CSL-88-3, January 1988.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
Wolfgang Reisig. Petri Nets. Springer-Verlag, 1985.
Charles L. Seitz. Concurrent architectures. In R. Suaya and G. Birtwistle, editors, VLSI and Parallel Computation, pages 1–84. Morgan Kaufmann, 1990.
E. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21:413–510, 1989.
Arthur Trew and Greg Wilson, editors. Past, Present, Parallel: A Survey of Parallel Computing at the Beginning of the 1990s. Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meseguer, J., Winkler, T. (1992). Parallel programming in maude. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_49
Download citation
DOI: https://doi.org/10.1007/3-540-55160-3_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55160-7
Online ISBN: 978-3-540-46762-5
eBook Packages: Springer Book Archive