Relating Conflict-Free Stable Transition and Event Models (Extended Abstract)

We describe an event-style (or poset) semantics for conflict-free rewrite systems, such as the Λ-calculus, and other stable transition systems with a residual relation. Our interpretation is based on considering redex families as events. It treats permutation-equivalent reductions as representing the same concurrent computation. Due to erasure of redexes, Event Structures are inadequate for such an interpretation. We therefore extend the Prime Event Structure model by axiomatizing permutation-equivalence on finite configurations in two different ways, for the conflict-free case, and show that these extended models are equivalent to known stable transition models with axiomatized residual and family relations.

[1]  Vincent van Oostrom,et al.  Higher-Order Families , 1996, RTA.

[2]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[3]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[4]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[5]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[6]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[7]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[8]  John R. W. Glauert,et al.  Discrete Normalization and Standardization in Deterministic Residual Structures , 1996, ALP.

[9]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

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

[11]  Georg Schied.  On Relating Rewriting Systems and Graph Grammars to Event Structures , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[12]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[13]  Cosimo LANEVE.  Distributive Evaluations of lambda-calculus , 1994, Fundam. Informaticae.

[14]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[15]  Glynn Winskel,et al.  An Introduction to Event Structures , 1989 .

[16]  David Clark,et al.  Event Structures and Non-Orthogonal Term Graph Rewriting , 1996, Math. Struct. Comput. Sci..

[17]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[18]  Glynn Winskel,et al.  Events in computation , 1980 .

[19]  J. R. Kennaway,et al.  Event structures and orthogonal term graph rewriting , 1993 .

[20]  J. Roger Hindley,et al.  An Abstract form of the church-rosser theorem. I , 1969, Journal of Symbolic Logic.

[21]  G Boudol.  Computational semantics of term rewriting systems , 1986 .

[22]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[23]  John R. W. Glauert,et al.  Relative Normalization in Deterministic Residual Structures , 1996, CAAP.

[24]  Luc Maranget,et al.  Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems , 1991, POPL '91.

[25]  Cosimo Laneve,et al.  Interaction Systems I: The Theory of Optimal Reductions , 1994, Math. Struct. Comput. Sci..

[26]  Jean-Jacques Lévy,et al.  An abstract standardisation theorem , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[27]  Hartmut Ehrig,et al.  An Event Structure Semantics for Safe Graph Grammars , 1994, PROCOMET.