The following pages link to Aart Middeldorp (Q293293):
Displaying 50 items.
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Multi-completion with termination tools (Q352956) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- A sequential reduction strategy (Q671504) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Modular properties of conditional term rewriting systems (Q689098) (← links)
- KBO orientability (Q846165) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- A deterministic lazy narrowing calculus (Q1264462) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Completeness of combinations of conditional constructor systems (Q1332335) (← links)
- Simple termination is difficult (Q1343111) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Type introduction for equational rewriting (Q1579057) (← links)
- Constructing cycles in the simplex method for DPLL(T) (Q1675808) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- FORT 2.0 (Q1799069) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Certifying proofs in the first-order theory of rewriting (Q2233502) (← links)
- Composing proof terms (Q2305425) (← links)
- Labelings for decreasing diagrams (Q2352504) (← links)
- Completeness of combinations of constructor systems (Q2368072) (← links)
- CSI: new evidence -- a progress report (Q2405264) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- (Q2723429) (← links)
- (Q2753692) (← links)
- (Q2763640) (← links)
- (Q2769431) (← links)
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems (Q2829264) (← links)
- Approximations for strategies and termination (Q2843601) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- A New and Formalized Proof of Abstract Completion (Q2879259) (← links)
- On the Domain and Dimension Hierarchy of Matrix Interpretations (Q2891464) (← links)
- Ordinals and Knuth-Bendix Orders (Q2891472) (← links)
- Layer systems for proving confluence (Q2911632) (← links)
- Polynomial interpretations over the natural, rational and real numbers revisited (Q2921119) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- Normalized completion revisited (Q2958393) (← links)
- Beyond Peano Arithmetic – Automatically Proving Termination of the Goodstein Sequence (Q2958394) (← links)
- (Q2980968) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- Satisfiability of Non-linear (Ir)rational Arithmetic (Q3066114) (← links)
- (Q3204048) (← links)
