Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald Uncurrying for termination and complexity. (English) Zbl 1286.68262 J. Autom. Reasoning 50, No. 3, 279-315 (2013). MSC: 68Q42 PDFBibTeX XMLCite \textit{N. Hirokawa} et al., J. Autom. Reasoning 50, No. 3, 279--315 (2013; Zbl 1286.68262) Full Text: DOI
Blanqui, Frédéric; Roux, Cody On the relation between sized-types based termination and semantic labelling. (English) Zbl 1257.68091 Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 147-162 (2009). MSC: 68Q42 03B40 PDFBibTeX XMLCite \textit{F. Blanqui} and \textit{C. Roux}, Lect. Notes Comput. Sci. 5771, 147--162 (2009; Zbl 1257.68091) Full Text: DOI Link
Vágvölgyi, Sándor Right-linear half-monadic term rewrite systems. (English) Zbl 1070.68058 Theor. Comput. Sci. 309, No. 1-3, 195-211 (2003). MSC: 68Q42 PDFBibTeX XMLCite \textit{S. Vágvölgyi}, Theor. Comput. Sci. 309, No. 1--3, 195--211 (2003; Zbl 1070.68058) Full Text: DOI
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans Relative undecidability in term rewriting. II: The confluence hierarchy. (English) Zbl 1012.68097 Inf. Comput. 178, No. 1, 132-148 (2002). MSC: 68Q42 03D35 PDFBibTeX XMLCite \textit{A. Geser} et al., Inf. Comput. 178, No. 1, 132--148 (2002; Zbl 1012.68097) Full Text: DOI
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans Relative undecidability in term rewriting. I: The termination hierarchy. (English) Zbl 1012.68096 Inf. Comput. 178, No. 1, 101-131 (2002). MSC: 68Q42 03D35 PDFBibTeX XMLCite \textit{A. Geser} et al., Inf. Comput. 178, No. 1, 101--131 (2002; Zbl 1012.68096) Full Text: DOI
Arts, T.; Giesl, J. Termination of term rewriting using dependency pairs. (English) Zbl 0938.68051 Theor. Comput. Sci. 236, No. 1-2, 133-178 (2000). MSC: 68Q42 PDFBibTeX XMLCite \textit{T. Arts} and \textit{J. Giesl}, Theor. Comput. Sci. 236, No. 1--2, 133--178 (2000; Zbl 0938.68051) Full Text: DOI
Ferreira, M. C. F.; Zantema, H. Dummy elimination: making termination easier. (English) Zbl 1503.68107 Reichel, Horst (ed.), Fundamentals of computation theory. 10th international conference, FCT’95, Dresden, Germany, August 22–25, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 965, 243-252 (1995). MSC: 68Q42 PDFBibTeX XMLCite \textit{M. C. F. Ferreira} and \textit{H. Zantema}, Lect. Notes Comput. Sci. 965, 243--252 (1995; Zbl 1503.68107) Full Text: DOI