Confluence by Decreasing Diagrams
暂无分享,去创建一个
[1] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .
[2] Vincent van Oostrom,et al. Diagram Techniques for Confluence , 1998, Inf. Comput..
[3] Patrick Dehornoy,et al. Braids and self-distributivity , 2000 .
[4] de Ng Dick Bruijn. A note on weak diamond properties , 1978 .
[5] V. van Oostrom,et al. Confluence for Abstract and Higher-Order Rewriting , 1994 .
[6] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[7] Vincent van Oostrom. Random Descent , 2007, RTA.
[8] Terese. Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.
[9] Bruno Buchberger,et al. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.
[10] Salvador Lucas,et al. Generalizing Newman's Lemma for Left-Linear Rewrite Systems , 2006, RTA.
[11] Jean-Pierre Jouannaud,et al. On Multiset Orderings , 1982, Inf. Process. Lett..
[12] Vincent van Oostrom,et al. A geometric proof of confluence by decreasing diagrams , 2000, J. Log. Comput..
[13] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.
[14] Jan Willem Klop,et al. Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.
[15] Damien Pous,et al. New up-to techniques for weak bisimulation , 2007, Theor. Comput. Sci..
[16] Enno Ohlebusch,et al. Advanced Topics in Term Rewriting , 2002, Springer New York.
[17] Alfons Geser,et al. Relative Termination , 1990 .
[18] Enno Ohlebusch,et al. Term Rewriting Systems , 2002 .
[19] Vincent van Oostrom,et al. Confluence by Decreasing Diagrams , 1994, Theor. Comput. Sci..