Higher-order constrained dependency pairs for (universal) computability
From MaRDI portal
Cites work
- A static higher-order dependency pair framework
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Continuous reasoning: scaling the impact of formal methods
- Cutting a proof into bite-sized chunks: incrementally proving termination in higher-order term rewriting (invited talk)
- Depth-First Search and Linear Graph Algorithms
- Dynamic dependency pairs for algebraic functional systems
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- scientific article; zbMATH DE number 996558 (Why is no real title available?)
- scientific article; zbMATH DE number 1354152 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- Inductive-data-type systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Mechanizing and improving dependency pairs
- Rewriting Techniques and Applications
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Term Rewriting with Logical Constraints
- Termination of term rewriting using dependency pairs
- Termination of term rewriting: Interpretation and type elimination
- The Computability Path Ordering: The End of a Quest
- Tuple Interpretations for Higher-Order Complexity.
- Tuple interpretations for termination of term rewriting
- Wanda -- a higher-order termination tool (system description)
This page was built for publication: Higher-order constrained dependency pairs for (universal) computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241064)
