Efficient unification over infinite terms
- 1 September 1984
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 2 (3) , 207-219
- https://doi.org/10.1007/bf03037057
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Linear unificationJournal of Computer and System Sciences, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975