Order-sorted dependency pairs

Types (or sorts) are pervasive in computer science and in rewritingbased programming languages, which often support subtypes (subsorts) and subtype polymorphism. Programs in these languages can be modeled as order-sorted term rewriting systems (OS-TRSs). Often, termination of such programs heavily depends on sort information. But few techniques are currently available for proving termination of OS-TRSs; and they often fail for interesting OS-TRSs. In this paper we generalize the dependency pairs approach to prove termination of OS-TRSs. Preliminary experiments suggest that this technique can succeed where existing ones fail, yielding easier and simpler termination proofs

[1]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[2]  Raúl Gutiérrez,et al.  Context-sensitive dependency pairs , 2006, Inf. Comput..

[3]  Yoshihito Toyama,et al.  Argument Filtering Transformation , 1999, PPDP.

[4]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

[5]  Nao Hirokawa,et al.  Automating the Dependency Pair Method , 2005, CADE.

[6]  Takahito Aoto,et al.  Dependency Pairs for Simply Typed Term Rewriting , 2005, RTA.

[7]  Francisco Durán,et al.  Proving termination of membership equational programs , 2004, PEPM '04.

[8]  Isabelle Gnaedig,et al.  Termination of Order-sorted Rewriting , 1992, ALP.

[9]  Claude Marché,et al.  Modular and incremental proofs of AC-termination , 2004, J. Symb. Comput..

[10]  Jürgen Giesl,et al.  Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages , 2006, RTA.

[11]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[12]  Peter Csaba Ölveczky,et al.  Order-Sorted Termination: The Unsorted Way , 1996, ALP.

[13]  Nachum Dershowitz,et al.  Termination by Abstraction , 2004, ICLP.

[14]  Jürgen Giesl,et al.  Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.

[15]  Nao Hirokawa,et al.  Tyrolean termination tool: Techniques and features , 2007, Inf. Comput..

[16]  Jürgen Giesl,et al.  Automated Termination Analysis for Logic Programs by Term Rewriting , 2006, LOPSTR.

[17]  Takahito Aoto.  Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems , 2001, J. Funct. Log. Program..

[18]  Salvador Lucas,et al.  mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting , 2004, RTA.

[19]  Jean-Pierre Jouannaud,et al.  Operational Semantics for Order-Sorted Algebra , 1985, ICALP.

[20]  Enno Ohlebusch,et al.  Modular Termination Proofs for Rewriting Using Dependency Pairs , 2002, J. Symb. Comput..

[21]  Salvador Lucas,et al.  Termination of on-demand rewriting and termination of OBJ programs , 2001, PPDP '01.

[22]  Raúl Gutiérrez,et al.  Improving the Context-sensitive Dependency Graph , 2007, PROLE.

[23]  Jürgen Giesl,et al.  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.

[24]  José Meseguer,et al.  Operational Termination of Membership Equational Programs: the Order-Sorted Way , 2009, WRLA.

[25]  Jürgen Giesl,et al.  Mechanizing and Improving Dependency Pairs , 2006, Journal of Automated Reasoning.

[26]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[27]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[28]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[29]  Francisco Durán,et al.  MTT: The Maude Termination Tool (System Description) , 2008, IJCAR.

[30]  Jürgen Giesl,et al.  Dependency Pairs for Equational Rewriting , 2001, RTA.

[31]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

[32]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[33]  Francisco Durán,et al.  Proving operational termination of membership equational programs , 2008, High. Order Symb. Comput..

[34]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[35]  Jan Maluszynski,et al.  Logic, Programming and Prolog (2ed) , 1995 .

[36]  Nao Hirokawa,et al.  Dependency Pairs Revisited , 2004, RTA.

[37]  Masahiko Sakai,et al.  Enhancing dependency pair method using strong computability in simply-typed term rewriting , 2007, Applicable Algebra in Engineering, Communication and Computing.