Enumerating outer narrowing derivations for constructor-based term rewriting systems
From MaRDI portal
Publication:1124376
DOI10.1016/S0747-7171(89)80015-XzbMATH Open0678.68099OpenAlexW1986964021MaRDI QIDQ1124376FDOQ1124376
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
Recommendations
Cites Work
- An Efficient Unification Algorithm
- Title not available (Why is that?)
- Computing in systems described by equations
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Basic narrowing revisited
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equality, types, modules, and (why not?) generics for logic programming
- Title not available (Why is that?)
- Computing with rewrite systems
- Extended unification algorithms for the integration of functional programming into logic programming
- Title not available (Why is that?)
- A class of confluent term rewriting systems and unification
Cited In (5)
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)