KUSAKARI, Keiichirou

Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the argument filtering methods, which are very effective and efficient support methods for proving termination

Higher-Order Path Orders Based on Computability

Abstract

Similar works

Full text

Available Versions

Institutional Repositories DataBase (IRDB)