An abstract standardisation theorem

An axiomatic version of the standardization theorem that shows the necessary basic properties between nesting of redexes and residuals is presented. This axiomatic approach provides a better understanding of standardization, and makes it applicable in other settings, such as directed acyclic graphs (dags) or interaction networks. conflicts between redexes are also treated. The axioms include stability in the sense given by G. Berry (Ph.D. thesis, Univ. of Paris, 1979), proving it to be an intrinsic notion of deterministic calculi.<<ETX>>

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

[2]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

[3]  Jean-Jacques Lévy,et al.  Minimal and Optimal Computations of Recursive Programs , 1979, J. ACM.

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

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

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

[7]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

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

[9]  Computations in Orthogonal Rewriting Systems, I , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[10]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..