Rewriting as a unified model of concurrency

The lecture given at the workshop was based on recent work published elsewhere [9, 10, 8, 7]. This abstract gives a brief description of the main results and ideas presented in that work, but does not provide any technical details; such details can be found in the papers mentioned above.

[1]  José Meseguer,et al.  An algebraic axiomatization of linear logic models , 1991 .

[2]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[3]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.

[5]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[6]  José Meseguer,et al.  Conditional Rewriting Logic: Deduction, Models and Concurrency , 1990, CTRS.

[7]  Joost Engelfriet,et al.  Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs , 1990, REX Workshop.

[8]  Joost Engelfriet,et al.  FORMALIZING THE BEHAVIOUR OF PARALLEL OBJECT-BASED SYSTEMS BY PETRI NETS , 1990 .

[9]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[10]  John W. Gray,et al.  Categories in Computer Science and Logic , 1989 .

[11]  K. Mani Chandy.  Parallel program design , 1989 .

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[14]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[15]  José Meseguer,et al.  Software for the Rewrite Rule Machine , 1988, Fifth Generation Computer Systems.

[16]  José Meseguer,et al.  An Introduction to OBJ 3 , 1988, CTRS.

[17]  David E. Rydeheard,et al.  Foundations of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms , 1987, Category Theory and Computer Science.

[18]  José Meseguer,et al.  Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics , 1987, Research Directions in Object-Oriented Programming.

[19]  Gul Agha,et al.  Concurrent programming using actors , 1987 .

[20]  José Meseguer,et al.  Extensions and foundations of object-oriented programming , 1986, OOPWORK '86.

[21]  José Meseguer,et al.  Concurrent term rewriting as a model of computation , 1986, Graph Reduction.

[22]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[23]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[24]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[25]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[26]  F. William Lawvere,et al.  Adjointness in Foundations , 1969 .