Termination of Simply Typed Term Rewriting by Translation and Labelling-Reference-Cited by-同舟云学术

Termination of Simply Typed Term Rewriting by Translation and Labelling

Published:2003 Issue: Volume: Page:380-394
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Aoto Takahito,Yamada Toshiyuki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44881-0_27

Reference11 articles.

1. T. Aoto and T. Yamada. Proving termination of simply typed term rewriting systems automatically. IPSJ Transactions on Programming, 44(SIG 4 PRO 17):67–77, 2003. In Japanese.

2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.

3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, Cambridge, 1998.

4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–320. Elsevier Science Publishers, 1990.

5. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science (LICS’91), pages 350–361, 1991.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms;Automated Deduction – CADE 26;2017

2. A Lambda-Free Higher-Order Recursive Path Order;Lecture Notes in Computer Science;2017

3. Uncurrying for Termination and Complexity;Journal of Automated Reasoning;2012-04-25

4. Argument Filterings and Usable Rules for Simply Typed Dependency Pairs;Frontiers of Combining Systems;2009

5. Uncurrying for Termination;Logic for Programming, Artificial Intelligence, and Reasoning;2008