Linear unification

Authors:
M. S. Paterson;M. N. Wegman
Affiliations:
-;-
Venue:
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Year:
1976

Citing 1
Cited 19

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)

Decidability of the purely existential fragment of the theory of term algebras

Journal of the ACM (JACM)
Unification: a multidisciplinary survey

ACM Computing Surveys (CSUR)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Pattern Matching in Trees

Journal of the ACM (JACM)
Off-line and on-line algorithms for deducing equalities

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The equivalence problem for program schemata with nonintersecting loops

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inferring types in Smalltalk

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logic Programming with Arrays

IEEE Transactions on Knowledge and Data Engineering
Facilitating reuse in hardware models with enhanced type inference

Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Matching with multiplication and exponentiation (extended abstract)

Mathematical Structures in Computer Science
Parallel processing of resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Improving the efficiency of higher order unification

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Rational Unification in 28 Characters

Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing unification algorithms in first-order theorem proving

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
SecPAL: Design and semantics of a decentralized authorization language

Journal of Computer Security - Digital Identity Management (DIM 2007)
Engineering higher-order modules in SML/NJ

IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
The first-order nominal link

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Induction variable analysis with delayed abstractions

HiPEAC'05 Proceedings of the First international conference on High Performance Embedded Architectures and Compilers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A unification algorithm is described which tests a set of expressions for unifiability and which requires time and space which are only linear in the size of the input.