Order-sorted unification
Open Access
- 1 October 1989
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (4) , 383-413
- https://doi.org/10.1016/s0747-7171(89)80036-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Many-sorted unificationJournal of the ACM, 1988
- An algebraic semantics approach to the effective resolution of type equationsTheoretical Computer Science, 1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965