Enumerating outer narrowing derivations for constructor-based term rewriting systems

DOI10.1016/S0747-7171(89)80015-XMaRDI QIDQ1124376zbMATH OpenOpenAlexFDO

Authors Jia-Huai You

Publication date 1989

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0747-7171(89)80015-x

zbMATH Keywords

equational theoriesmatching problemNarrowingequational logic programs

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 4060700
• Narrowing directed by a graph of terms
• scientific article; zbMATH DE number 969074
• S-narrowing for constructor systems
• scientific article; zbMATH DE number 3960989

Cites work

• scientific article; zbMATH DE number 3867289 (Why is no real title available?)
• scientific article; zbMATH DE number 3817070 (Why is no real title available?)
• scientific article; zbMATH DE number 3921947 (Why is no real title available?)
• scientific article; zbMATH DE number 3936507 (Why is no real title available?)
• scientific article; zbMATH DE number 3945331 (Why is no real title available?)
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 4041327 (Why is no real title available?)
• scientific article; zbMATH DE number 4041328 (Why is no real title available?)
• scientific article; zbMATH DE number 4045129 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 3413831 (Why is no real title available?)
• A class of confluent term rewriting systems and unification
• An Efficient Unification Algorithm
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Basic narrowing revisited
• Computing in systems described by equations
• Computing with rewrite systems
• Equality, types, modules, and (why not?) generics for logic programming
• Extended unification algorithms for the integration of functional programming into logic programming

Cited in

(5)

• Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
• Completeness results for basic narrowing
• scientific article; zbMATH DE number 4060700 (Why is no real title available?)
• A debugging scheme for functional logic programs
• Lazy narrowing: strong completeness and eager variable elimination

This page was built for publication: Enumerating outer narrowing derivations for constructor-based term rewriting systems

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