Unification in combinations of collapse-free theories with disjoint sets of function symbols
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some relationships between unification, restricted unification, and matchingPublished by Springer Nature ,1986
- Combination of unification algorithmsPublished by Springer Nature ,1986
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- Combining unification algorithms for confined regular equational theoriesPublished by Springer Nature ,1985
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935