论文信息 - Modularity of Confluence: A Simplified Proof - 字舞流文

Modularity of Confluence: A Simplified Proof

Yoshihito Toyama | Aart Middeldorp | Jan Willem Klop | Roel C. de Vrijer | J. Klop | A. Middeldorp | Y. Toyama | R. D. Vrijer

[1] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[2] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[3] Yoshihito Toyama,et al. On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

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

[5] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[6] Val Tannen,et al. Polymorphic Rewriting Conserves Algebraic Strong Normalization , 1991, Theor. Comput. Sci..

[7] Jean-Pierre Jouannaud,et al. A computation model for executable higher-order algebraic specification languages , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[8] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .

[9] Val Tannen,et al. Polymorphic Rewriting Conserves Algebraic Confluence , 1994, Inf. Comput..

[10] Viggo Stoltenberg-hansen,et al. In: Handbook of Logic in Computer Science , 1995 .

[11] Jan Willem Klop,et al. Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.