Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
From MaRDI portal
Recommendations
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Automated termination proofs for logic programs by term rewriting
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Proving termination of programs automatically with AProVE
- Termination Analysis with Calling Context Graphs
Cited in
(29)- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
- Proving operational termination of membership equational programs
- The Computability Path Ordering: The End of a Quest
- A Transformational Approach to Prove Outermost Termination Automatically
- Lazy productivity via termination
- Termination of narrowing via termination of rewriting
- Loops under Strategies
- Automatic synthesis of logical models for order-sorted first-order theories
- Degrees of Undecidability in Term Rewriting
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Proving termination by dependency pairs and inductive theorem proving
- scientific article; zbMATH DE number 970706 (Why is no real title available?)
- Termination Analysis with Calling Context Graphs
- Termination graphs for Java bytecode
- Deciding Innermost Loops
- A compact fixpoint semantics for term rewriting systems
- scientific article; zbMATH DE number 7453196 (Why is no real title available?)
- Methods for proving termination of rewriting-based programming languages by transformation
- Local Termination
- Localized operational termination in general logics
- scientific article; zbMATH DE number 5785597 (Why is no real title available?)
- Proving Termination of Integer Term Rewriting
- Termination of lazy rewriting revisited
- Mechanizing and improving dependency pairs
- Lower bounds for runtime complexity of term rewriting
- From Outermost Termination to Innermost Termination
- Termination Competition (termCOMP 2015)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
This page was built for publication: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527303)
