Unification theory
From MaRDI portal
Publication:1124375
DOI10.1016/S0747-7171(89)80012-4zbMath0678.68098MaRDI QIDQ1124375
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
68W30: Symbolic computation and algebraic computation
68Q65: Abstract data types; algebraic specification
Related Items
Retrieving library functions by unifying types modulo linear isomorphism, Unification and Passive Inference Rules for Modal Logics, Analogical projection in pattern perception, Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case, Using types as search keys in function libraries, Unification, finite duality and projectivity in varieties of Heyting algebras, A compositional semantic basis for the analysis of equational Horn programs, A combinatory logic approach to higher-order E-unification, Hilbert's tenth problem is of unification type zero, Complexity of unification problems with associative-commutative operators, The unification hierarchy is undecidable, Combining matching algorithms: The regular case, Discriminator varieties and symbolic computation, An order-sorted logic for knowledge representation systems, A new method for undecidability proofs of first order theories, Category equivalence preserves unification type, A decision algorithm for distributive unification, Word unification and transformation of generalized equations, Unification in free distributive lattices, Semi-unification of two terms in Abelian groups, Unification in partially commutative semigroups, The Kreisel length-of-proof problem, Incremental constraint satisfaction for equational logic programming, Unification in sort theories and its applications, Reduction of cycle unification of type \(Cpg+r\), Unification in commutative semigroups, A unification-theoretic method for investigating the \(k\)-provability problem, A formal semantics for DAI language NUML, Linear and unit-resulting refutations for Horn theories, Best solving modal equations, Unnamed Item
Uses Software
