Termination of narrowing via termination of rewriting
From MaRDI portal
Publication:969619
DOI10.1007/s00200-010-0122-4zbMath1197.68049OpenAlexW2051564255MaRDI QIDQ969619
Publication date: 7 May 2010
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-010-0122-4
Related Items
Relative termination via dependency pairs ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization ⋮ Termination of Narrowing Using Dependency Pairs ⋮ SGGS decision procedures
Uses Software
Cites Work
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- Termination of rewriting
- Completeness results for basic narrowing
- Termination of term rewriting using dependency pairs
- Type-level Computation Using Narrowing in Ωmega
- Extra Variables Can Be Eliminated from Functional Logic Programs
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Specialization of functional logic programs based on needed narrowing
- A needed narrowing strategy
- TPA: Termination Proved Automatically
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Multi-paradigm Declarative Languages
- Automatic mode inference for logic programs
- An Efficient Unification Algorithm
- Logic programming with functions and predicates: The language Babel
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Termination of logic programs: the never-ending story
- The integration of functions into logic programming: From theory to practice
- Term Rewriting and All That
- A semantic basis for the termination analysis of logic programs
- Functional Logic Programming: From Theory to Curry
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Termination of Narrowing in Left-Linear Constructor Systems
- Termination of Narrowing Using Dependency Pairs
- Term Rewriting and Applications
- Logic for Programming, Artificial Intelligence, and Reasoning
- Program Development in Computational Logic
- The narrowing-driven approach to functional logic program specialization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
