ELAN from a rewriting logic point of view, Theoretical Computer Science, vol.285, issue.2, pp.155-185, 2002. ,
DOI : 10.1016/S0304-3975(01)00358-9
Recursive Path Orderings Can Be Context-Sensitive, Proc. of 18th International Conference on Automated Deduction, pp.314-331, 2002. ,
DOI : 10.1007/3-540-45620-1_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6449
Specification and proof in membership equational logic, Theoretical Computer Science, vol.236, issue.1-2, pp.35-132, 2000. ,
DOI : 10.1016/S0304-3975(99)00206-6
URL : https://hal.archives-ouvertes.fr/inria-00099079
Generalized Rewrite Theories, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pp.252-266, 2003. ,
DOI : 10.1007/3-540-45061-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8329
Maude: specification and programming in rewriting logic, Theoretical Computer Science, vol.285, issue.2, pp.187-243, 2002. ,
DOI : 10.1016/S0304-3975(01)00359-0
Maude Manual (Version 2.2), 2005. ,
Proving termination of rewriting with CiME, Proc. WST'03, 2003. ,
Proving termination of membership equational programs, Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '04, pp.147-158, 2004. ,
DOI : 10.1145/1014007.1014022
Context-Sensitive AC-rewriting, Proc. RTA'99, pp.286-300, 1999. ,
DOI : 10.1007/3-540-48685-2_24
Cariboo: An induction based proof tool for termination with strategies, Proc. PPDP'02, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00107557
Verification of Erlang Processes by Dependency Pairs Applicable Algebra in Engineering, Communications and Computing, vol.12, pp.39-72, 2001. ,
Modular Termination Proofs for Rewriting Using Dependency Pairs, Journal of Symbolic Computation, vol.34, issue.1, pp.21-58, 2002. ,
DOI : 10.1006/jsco.2002.0541
Transformation techniques for context-sensitive rewrite systems, Journal of functional Programming, vol.14, issue.4, pp.379-427, 2004. ,
DOI : 10.1017/S0956796803004945
Proving and Disproving Termination of Higher-Order Functions, Proc. of 5th International Workshop on Frontiers of Combining Systems, FroCoS'05, pp.216-231, 2005. ,
DOI : 10.1007/11559306_12
AProVE: A system for proving termination, van Oostrom ,
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science, vol.105, issue.2, pp.217-273, 1992. ,
DOI : 10.1016/0304-3975(92)90302-V
URL : http://doi.org/10.1016/0304-3975(92)90302-v
Tyrolean Termination Tool, Proc. RTA'05, pp.175-184, 2005. ,
DOI : 10.1007/978-3-540-32033-3_14
Report on the Functional Programming Language Haskell: a non?strict, purely functional language, Sigplan Notices, vol.27, pp.1-164, 1992. ,
Termination of context-sensitive rewriting by rewriting, Proc. of ICALP'96, pp.122-133, 1996. ,
DOI : 10.1007/3-540-61440-0_122
Context-sensitive computations in functional and functional logic programs, Journal of Functional and Logic Programming, issue.1, 1998. ,
Context-sensitive rewriting strategies. Information and Computation, pp.294-343, 2002. ,
DOI : 10.1006/inco.2002.3176
URL : http://doi.org/10.1006/inco.2002.3176
Termination of programs with strategy annotations, 2003. ,
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting ,
DOI : 10.1007/978-3-540-25979-4_14
Polynomials for Proving Termination of Context-Sensitive Rewriting, Proc. FOSSACS'04, pp.318-332, 2004. ,
DOI : 10.1007/978-3-540-24727-2_23
Proving termination of context-sensitive rewriting by transformation. Information and Computation , to appear, 2006. ,
Operational termination of conditional term rewriting systems, Information Processing Letters, vol.95, issue.4, pp.446-453, 2005. ,
DOI : 10.1016/j.ipl.2005.05.002
Modular and incremental proofs of AC-termination, Journal of Symbolic Computation, vol.38, issue.1, pp.873-897, 2004. ,
DOI : 10.1016/j.jsc.2004.02.003
Unravelings and ultra-properties, Proc. of ALP'96, pp.107-121, 1996. ,
DOI : 10.1007/3-540-61735-3_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.507
General Logics, Logic Colloquium'87, pp.275-329, 1989. ,
DOI : 10.1016/S0049-237X(08)70132-0
Membership algebra as a logical framework for equational specification, Proceedings WADT'97, pp.18-61, 1998. ,
DOI : 10.1007/3-540-64299-4_26
Initiality, induction and computability, Algebraic Methods in Semantics, pp.459-541, 1985. ,
Advanced Topics in Term Rewriting, 2002. ,
DOI : 10.1007/978-1-4757-3661-8
Hierarchical termination revisited, Information Processing Letters, vol.84, issue.4, pp.207-214, 2002. ,
DOI : 10.1016/S0020-0190(02)00272-7
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems, Proc. IJCAR'01, pp.485-498, 2001. ,
DOI : 10.1007/3-540-45744-5_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9837
Modular and Incremental Automated Termination Proofs, Journal of Automated Reasoning, vol.25, issue.4, pp.315-355, 2004. ,
DOI : 10.1007/BF03177743
Language Prototyping: An Algebraic Specification Approach, World Scientific, vol.5, 1996. ,
DOI : 10.1142/3163
Equational rules for rewriting logic, Theoretical Computer Science, vol.285, issue.2, pp.487-517, 2002. ,
DOI : 10.1016/S0304-3975(01)00366-8
URL : http://doi.org/10.1016/s0304-3975(01)00366-8
Termination of context-sensitive rewriting, Proc. RTA'97, pp.172-186, 1997. ,
DOI : 10.1007/3-540-62950-5_69