Author:
Komendantskaya Ekaterina,Johann Patricia,Schmidt Martin
Publisher
Springer International Publishing
Reference22 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(12), 133–178 (2000)
2. Courcelle, B.: Fundamental properties of infinite trees. TCS 25, 95–169 (1983)
3. de Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. J. Logic Program. 19–20(Supplement 1), 199–260 (1994)
4. Endrullis, J., et al.: Productivity of stream definitions. TCS 411(4–5), 765–782 (2010)
5. Endrullis, J., et al.: A coinductive framework for infinitary rewriting and equational reasoning. In: RTA, pp. 143–159 (2015)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Checked corecursive streams: Expressivity and completeness;Theoretical Computer Science;2023-09
2. Enhancing Expressivity of Checked Corecursive Streams;Functional and Logic Programming;2022
3. Flexible coinductive logic programming;Theory and Practice of Logic Programming;2020-09-22
4. Logic programming: Laxness and saturation;Journal of Logical and Algebraic Methods in Programming;2018-12
5. Productive corecursion in logic programming;Theory and Practice of Logic Programming;2017-08-22