On the sequential nature of unification
- 30 June 1984
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 1 (1) , 35-50
- https://doi.org/10.1016/0743-1066(84)90022-0
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- An overview of computational complexityCommunications of the ACM, 1983
- Unifiability is complete for co-NLogSpaceInformation Processing Letters, 1982
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Linear unificationJournal of Computer and System Sciences, 1978
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965