Jambox

swMATH10066MaRDI QIDQ22035FDOQ22035

Author name not available (Why is that?)

Cited In (15)

• Proving Termination in the Context-Sensitive Dependency Pair Framework
• Modular and Certified Semantic Labeling and Unlabeling
• A Transformational Approach to Prove Outermost Termination Automatically
• Title not available (Why is that?)
• Loops under Strategies
• Lazy productivity via termination
• Title not available (Why is that?)
• Proving Termination Properties with mu-term
• Search Techniques for Rational Polynomial Orders
• Generalized and Formalized Uncurrying
• Certifying a Termination Criterion Based on Graphs, without Graphs
• Increasing interpretations
• Termination of String Rewriting with Matrix Interpretations
• Context-sensitive dependency pairs
• Termination of just/fair computations in term rewriting

This page was built for software: Jambox