Termination of Narrowing in Left-Linear Constructor Systems

DOI10.1007/978-3-540-78969-7_10MaRDI QIDQ5458432zbMATH OpenOpenAlexFDO

Authors Germán Vidal

Publication date 11 April 2008

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78969-7_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination of narrowing via termination of rewriting
• Termination of narrowing revisited
• Narrowing and rewriting logic: from foundations to applications
• S-narrowing for constructor systems
• Goal-directed and relative dependency pairs for proving the termination of narrowing

Cites work

• scientific article; zbMATH DE number 1614705 (Why is no real title available?)
• scientific article; zbMATH DE number 4090779 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 512906 (Why is no real title available?)
• scientific article; zbMATH DE number 1088020 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• A needed narrowing strategy
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Extra variables can be eliminated from functional logic programs
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Foundations of equational logic programming
• Functional Logic Programming: From Theory to Curry
• Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
• Lazy narrowing in a graph machine
• Mechanizing and improving dependency pairs
• Narrowing directed by a graph of terms
• Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of rewriting
• Termination of term rewriting using dependency pairs
• The integration of functions into logic programming: From theory to practice
• The narrowing-driven approach to functional logic program specialization
• Type-level computation using narrowing in \(\Omega\)mega

Cited in

(10)

• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of narrowing via termination of rewriting
• Termination of narrowing revisited
• Reducing relative termination to dependency pair problems
• Goal-directed and relative dependency pairs for proving the termination of narrowing
• Relative termination via dependency pairs
• A dependency pair framework for relative termination of term rewriting
• Narrowing trees for syntactically deterministic conditional term rewriting systems
• Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
• S-narrowing for constructor systems

Describes a project that uses

Uses Software

• AProVE
• BABEL

This page was built for publication: Termination of Narrowing in Left-Linear Constructor Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458432)