Results 281 to 290 of about 12,133 (300)
Some of the next articles are maybe not open access.
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters, 1987Yoshihito Toyama
exaly
Termination of term rewriting using dependency pairs
Theoretical Computer Science, 2000Thomas Arts, Jürgen Gießl
exaly
Term rewriting and Hoare logic — Coded rewriting
Information Processing Letters, 1996openaire +1 more source
Decidability for Left-Linear Growing Term Rewriting Systems
Information and Computation, 2002Yoshihito Toyama
exaly
Natural Rewriting for General Term Rewriting Systems
2005Santiago Escobar 0001 +2 more
openaire +1 more source
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems, 2011Jürgen Gießl +2 more
exaly
On termination of the direct sum of term-rewriting systems
Information Processing Letters, 1987Michael Rusinowitch
exaly
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science, 2007Raúl Gutierrez, Salvador Lucas
exaly
The undecidability of self-embedding for term rewriting systems
Information Processing Letters, 1985David A Plaisted
exaly