scientific article; zbMATH DE number 1332639
From MaRDI portal
Publication:4259966
zbMath0924.68106MaRDI QIDQ4259966
Publication date: 9 September 1999
Full work available at URL: http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/1998/A98-01/A98-01.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
A proof method for local sufficient completeness of term rewriting systems ⋮ Unnamed Item ⋮ Relaxing monotonicity for innermost termination ⋮ Automatically Proving and Disproving Feasibility Conditions ⋮ mu-term: Verify Termination Properties Automatically (System Description) ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Modularity in term rewriting revisited ⋮ Twenty years of rewriting logic ⋮ Unnamed Item ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings ⋮ MTT: The Maude Termination Tool (System Description) ⋮ Completeness of context-sensitive rewriting ⋮ Completion after Program Inversion of Injective Functions ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Unnamed Item ⋮ Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications ⋮ Lazy productivity via termination ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Proving operational termination of membership equational programs ⋮ From Outermost Termination to Innermost Termination ⋮ Context-sensitive dependency pairs ⋮ Proving Termination Properties with mu-term ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Loops under Strategies ⋮ Local Termination ⋮ From Outermost to Context-Sensitive Rewriting ⋮ Compact Normalisation Trace via Lazy Rewriting ⋮ Lazy Rewriting and Context-Sensitive Rewriting ⋮ On-demand strategy annotations revisited: an improved on-demand evaluation strategy ⋮ Context-sensitive rewriting strategies ⋮ Transformation for Refining Unraveled Conditional Term Rewriting Systems ⋮ Improving the Context-sensitive Dependency Graph ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM ⋮ Termination of Lazy Rewriting Revisited
This page was built for publication:
