Combining unification algorithms for confined regular equational theories
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 365-380
- https://doi.org/10.1007/3-540-15976-2_18
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Incremental construction of unification algorithms in equational theoriesPublished by Springer Nature ,2006
- Rewrite methods for clausal and non-clausal theorem provingPublished by Springer Nature ,2006
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935