Unification in combinations of collapse-free regular theories
Author:
- Katherine A. YelickKYKatherine A. Yelick
- 4 February 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 3 (1-2) , 153-181
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- Implementation of a general completion procedure parameterized by built-in theories and strategiesLecture Notes in Computer Science, 1985
- Oriented equational clauses as a programming languageThe Journal of Logic Programming, 1984
- 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
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965