The following pages link to Frontiers of Combining Systems (Q5491901):
Displaying 31 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- KBO orientability (Q846165) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Termination of Lazy Rewriting Revisited (Q2873676) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Loops under Strategies (Q3636816) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- CSI – A Confluence Tool (Q5200045) (← links)
