Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems
暂无分享,去创建一个
[1] V. van Oostrom,et al. Confluence for Abstract and Higher-Order Rewriting , 1994 .
[2] Ralf Treinen,et al. The First-Order Theory of One-Step Rewriting is Undecidable , 1996, RTA.
[3] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .
[4] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[5] Markus A. Whiteland,et al. Degrees of Transducibility , 2015, WORDS.
[6] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[7] Juhani Karhumäki,et al. Degrees of Infinite Words, Polynomials and Atoms , 2016, DLT.
[8] Jakob Grue Simonsen,et al. Levels of undecidability in rewriting , 2011, Inf. Comput..
[9] Hans Zantema,et al. The Termination Hierarchy for Term Rewriting , 2001, Applicable Algebra in Engineering, Communication and Computing.
[10] J. Endrullis,et al. De Bruijn’s weak diamond property revisited , 2013 .
[11] Jan Willem Klop,et al. Combinatory reduction systems , 1980 .
[12] Vincent van Oostrom,et al. Confluence by Decreasing Diagrams , 1994, Theor. Comput. Sci..
[13] Jakob Grue Simonsen,et al. Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus , 2013, TOCL.
[14] Terese. Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.
[15] Vincent van Oostrom,et al. Confluence by Decreasing Diagrams Converted Vincent van Oostrom , 2008 .