A geometric proof of confluence by decreasing diagrams
暂无分享,去创建一个
[1] V. van Oostrom,et al. Confluence for Abstract and Higher-Order Rewriting , 1994 .
[3] 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).
[4] HuetGérard. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .
[5] Enno Ohlebusch,et al. Term Rewriting Systems , 2002 .
[6] Jan Willem Klop,et al. Combinatory reduction systems , 1980 .
[7] Vincent van Oostrom,et al. Confluence by Decreasing Diagrams , 1994, Theor. Comput. Sci..
[8] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[9] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[10] de Ng Dick Bruijn. A note on weak diamond properties , 1978 .
[11] John Staples. Church-Rosser theorems for replacement systems , 1975 .
[12] Vincent van Oostrom,et al. Diagram Techniques for Confluence , 1998, Inf. Comput..
[13] Nachum Dershowitz,et al. Orderings for Equational Proofs , 1986, LICS.
[14] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .