scientific article; zbMATH DE number 1765702

MaRDI QIDQ4539643zbMATH OpenFDO

Authors Aart Middeldorp

Publication date 10 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830593

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Beyond Dependency Graphs
• Approximations for strategies and termination
• Termination of term rewriting using dependency pairs
• Improving dependency pairs
• Rewriting Techniques and Applications

Cited in

(21)

• Decidable call-by-need computations in term rewriting
• Match-bounds revisited
• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• scientific article; zbMATH DE number 475414 (Why is no real title available?)
• Term orderings for non-reachability of (conditional) rewriting
• Enhancing dependency pair method using strong computability in simply-typed term rewriting
• Automating the dependency pair method
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Beyond Dependency Graphs
• Hierarchical termination revisited.
• Deciding \(\mathcal H_1\) by resolution
• Graph decompositions and tree automata in reasoning with uncertainty
• Use of logical models for proving infeasibility in term rewriting
• Mechanically proving termination using polynomial interpretations
• Elimination transformations for associative-commutative rewriting systems
• Modular termination proofs for rewriting using dependency pairs
• Modular and incremental automated termination proofs
• Proving semantic properties as first-order satisfiability
• Mechanizing and improving dependency pairs
• Context-sensitive dependency pairs
• Approximations for strategies and termination

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539643)