Termination of Narrowing in Left-Linear Constructor Systems

DOI10.1007/978-3-540-78969-7_10zbMATH Open1137.68420OpenAlexW4235424726MaRDI QIDQ5458432FDOQ5458432

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)

Cites Work

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

Cited In (4)

• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of narrowing via termination of rewriting
• Relative termination via dependency pairs
• Reducing Relative Termination to Dependency Pair Problems

Uses Software

• BABEL
• AProVE

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)