Pages that link to "Item:Q3527303"
From MaRDI portal
The following pages link to Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (Q3527303):
Displaying 25 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt) (Q2726244) (← links)
- Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
- Termination of lazy rewriting revisited (Q2873676) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Loops under Strategies (Q3636816) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Local Termination (Q3636830) (← links)
- Degrees of Undecidability in Term Rewriting (Q3644753) (← links)
- (Q5020657) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Localized Operational Termination in General Logics (Q5256340) (← links)
- (Q5688891) (← links)
- (Q5747911) (← links)
