The following pages link to Jambox (Q22035):
Displayed 15 items.
- Lazy productivity via termination (Q549188) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Increasing interpretations (Q1044231) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← links)
- (Q3077191) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Termination of String Rewriting with Matrix Interpretations (Q3527305) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- Loops under Strategies (Q3636816) (← links)
- Proving Termination in the Context-Sensitive Dependency Pair Framework (Q4933276) (← links)
- (Q5009706) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Modular and Certified Semantic Labeling and Unlabeling (Q5389090) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)