Journal of Automated Reasoning · 2012 · 14 citations · 24 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSyntaxAbstract Syntax TreesModel TransformationType SystemsDependency PairsRewrite System TerminationRewrite SystemsRewriting SystemsTerm RewritingTerm Rewriting SystemsTermination Of Higher-order RewritingTermination Of Term Rewriting Systems
First-order applicative rewrite systems provide a natural framework for modeling higher-order aspects. In this article we present a transformation from untyped applicative term rewrite systems to functional term rewrite systems that preserves and reflects termination. Our transformation is less restrictive than other approaches. In particular, head variables in right-hand sides of rewrite rules can be handled. To further increase the applicability of our transformation, we study the method for innermost rewriting and derivational complexity, and present a version for dependency pairs.
24
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Mechanizing and Improving Dependency Pairs
Jürgen Giesl, René Thiemann, Peter Schneider–Kamp et al. · Journal of Automated Reasoning · 2007 · 195 citations
Language Studies, Computer Science, Computational Linguistics +8