메뉴 건너뛰기




Volumn 3467, Issue , 2005, Pages 120-134

Dependency pairs for simply typed term rewriting

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FUNCTION EVALUATION; GRAPH THEORY; INFORMATION DISSEMINATION;

EID: 24944446109     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_10     Document Type: Conference Paper
Times cited : (13)

References (20)
  • 1
    • 84880246260 scopus 로고    scopus 로고
    • Termination of simply typed term rewriting systems by translation and labelling
    • Proceedings of the 14th International Conference on Rewriting Techniques and Applications Springer-Verlag
    • T. Aoto and T. Yamada. Termination of simply typed term rewriting systems by translation and labelling. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, pages 380-394. Springer-Verlag, 2003.
    • (2003) LNCS , vol.2706 , pp. 380-394
    • Aoto, T.1    Yamada, T.2
  • 3
    • 0001193616 scopus 로고    scopus 로고
    • Termination of term rewriting using dependency pairs
    • T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236(1-2):133-178, 2000.
    • (2000) Theoretical Computer Science , vol.236 , Issue.1-2 , pp. 133-178
    • Arts, T.1    Giesl, J.2
  • 5
    • 0036657874 scopus 로고    scopus 로고
    • Modular termination proofs for rewriting using dependency pairs
    • J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
    • (2002) Journal of Symbolic Computation , vol.34 , Issue.1 , pp. 21-58
    • Giesl, J.1    Arts, T.2    Ohlebusch, E.3
  • 6
    • 9444259855 scopus 로고    scopus 로고
    • Improving dependency pairs
    • Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning Springer-Verlag
    • J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2850 of LNAI, pages 165-179. Springer-Verlag, 2003.
    • (2003) LNAI , vol.2850 , pp. 165-179
    • Giesl, J.1    Thiemann, R.2    Schneider-Kamp, P.3    Falke, S.4
  • 8
    • 35048887144 scopus 로고    scopus 로고
    • Automated termination proofs with AProVE
    • Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Springer-Verlag
    • J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 210-220. Springer-Verlag, 2004.
    • (2004) LNCS , vol.3091 , pp. 210-220
    • Giesl, J.1    Thiemann, R.2    Schneider-Kamp, P.3    Falke, S.4
  • 9
    • 7044245493 scopus 로고    scopus 로고
    • Automating the dependency pair method
    • Proceedings of the 19th International Conference on Automated Deduction. Springer-Verlag
    • N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proceedings of the 19th International Conference on Automated Deduction, volume 2741 of LNAI. Springer-Verlag, 2003.
    • (2003) LNAI , vol.2741
    • Hirokawa, N.1    Middeldorp, A.2
  • 10
    • 35048819118 scopus 로고    scopus 로고
    • Dependency pairs revisited
    • Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Springer-Verlag
    • N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 249-268. Springer-Verlag, 2004.
    • (2004) LNCS , vol.3091 , pp. 249-268
    • Hirokawa, N.1    Middeldorp, A.2
  • 13
    • 1442267079 scopus 로고    scopus 로고
    • On proving termination of term rewriting systems with higher-order variables
    • SIG 7 PRO 11
    • K. Kusakari. On proving termination of term rewriting systems with higher-order variables. IPSJ Transactions on Programming, 42(SIG 7 PRO 11):35-45, 2001.
    • (2001) IPSJ Transactions on Programming , vol.42 , pp. 35-45
    • Kusakari, K.1
  • 14
    • 1442314944 scopus 로고    scopus 로고
    • Higher-order path orders based on computability
    • K. Kusakari. Higher-order path orders based on computability. IEICE Transactions on Information and Systems, E87-D(2):352-359, 2003.
    • (2003) IEICE Transactions on Information and Systems , vol.E87-D , Issue.2 , pp. 352-359
    • Kusakari, K.1
  • 15
    • 0002569005 scopus 로고    scopus 로고
    • Higher-order rewrite systems and their confluence
    • R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192(1):3-29, 1998.
    • (1998) Theoretical Computer Science , vol.192 , Issue.1 , pp. 3-29
    • Mayr, R.1    Nipkow, T.2
  • 18
    • 0035422887 scopus 로고    scopus 로고
    • An extension of dependency pair method for proving termination of higher-order rewrite systems
    • M. Sakai, Y. Watanabe, and T. Sakabe. An extension of dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems, E84-D(8): 1025-1032, 2001.
    • (2001) IEICE Transactions on Information and Systems , vol.E84-D , Issue.8 , pp. 1025-1032
    • Sakai, M.1    Watanabe, Y.2    Sakabe, T.3
  • 19
    • 9444229424 scopus 로고    scopus 로고
    • Improved modular termination proofs using dependency pairs
    • Proceedings of the 2nd International Joint Conference on Automated Reasoning. Springer-Verlag
    • R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proceedings of the 2nd International Joint Conference on Automated Reasoning, volume 3097 of LNAI, pages 75-90. Springer-Verlag, 2004.
    • (2004) LNAI , vol.3097 , pp. 75-90
    • Thiemann, R.1    Giesl, J.2    Schneider-Kamp, P.3
  • 20
    • 84888226770 scopus 로고    scopus 로고
    • Confluence and termination of simply typed term rewriting systems
    • Proceedings of the 12th International Conference on Rewriting Techniques and Applications. Springer-Verlag
    • T. Yamada. Confluence and termination of simply typed term rewriting systems. In Proceedings of the 12th International Conference on Rewriting Techniques and Applications, volume 2051 of LNCS, pages 338-352. Springer-Verlag, 2001.
    • (2001) LNCS , vol.2051 , pp. 338-352
    • Yamada, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.