Simple second-order languages for which unification is undecidable

This publication has 13 references indexed in Scilit:

• A unification-theoretic method for investigating the k-provability problem
  Annals of Pure and Applied Logic, 1991
• A unification algorithm for second-order monadic terms
  Annals of Pure and Applied Logic, 1988
• An Efficient Unification Algorithm
  ACM Transactions on Programming Languages and Systems, 1982
• The undecidability of the second-order unification problem
  Theoretical Computer Science, 1981
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
  Journal of the ACM, 1980
• Proving and applying program transformations expressed with second-order patterns
  Acta Informatica, 1978
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
  Mathematics of the USSR-Sbornik, 1977
• The undecidability of unification in third order logic
  Information and Control, 1973
• Hilbert's Tenth Problem is Unsolvable
  The American Mathematical Monthly, 1973
• Some results on the length of proofs
  Transactions of the American Mathematical Society, 1973