Natural termination
From MaRDI portal
Publication:673622
DOI10.1016/0304-3975(94)00275-4zbMath0873.68103OpenAlexW2913116145MaRDI QIDQ673622
Nachum Dershowitz, Charles Hoot
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00275-4
Related Items
Termination of constructor systems, On proving termination by innermost termination, Mobile Processes and Termination, An improved general path order, Jumping and escaping: modular termination and the abstract path ordering, Termination of term rewriting using dependency pairs, Unnamed Item, Ensuring termination by typability, TERMINATION OF ABSTRACT REDUCTION SYSTEMS, Non-Looping String Rewriting, Modular termination proofs for rewriting using dependency pairs
Uses Software
Cites Work
- Termination of rewriting systems by polynomial interpretations and its implementation
- Orderings for term-rewriting systems
- On the recursive decomposition ordering with lexicographical status and other related orderings
- Termination of rewriting
- A geometrical approach to multiset orderings
- Computing in systems described by equations
- An improved general path order
- On theories with a combinatorial definition of 'equivalence'
- Proving termination with multiset orderings
- Equational inference, canonical proofs, and proof orderings
- Topics in termination
- Polynomial time termination and constraint satisfaction tests
- Proving Properties of Programs by Structural Induction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
