On the undecidability of second-order unification

Information and Computation

Volumn 159, Issue 1-2, 2000, Pages 125-150

  Levy, Jordi ^a   Veanes, Margus ^b  

^a CSIC   (Spain)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; PROBLEM SOLVING;

UNIFICATION;

COMPUTATIONAL METHODS;

EID: 0034713205     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2877     Document Type: Article

References (47)

1. Baader, F., and Nipkow, T. (1998), "Term Rewriting and All That," Cambridge University Press, Cambridge, UK.
2. Brainerd, W. (1969), Tree generating regular systems, Inform. and Control 14, 217-231.
3. Comon, H. (1993), Completion of rewrite systems with membership constraints, to appear in J. Symbolic Comput.
4. Comon, H., and Jurski, Y. (1997), Higher-order matching and tree automata, in "Proc. Conf. on Computer Science Logic" (M. Nielsen and W. Thomas, Eds.), Lecture Notes in Computer Science, Vol. 1414, pp. 157-176, Springer-Verlag, Berlin.
5. Cortier, V., Ganzinger, H., Jacquemard, F., and Veanes, M. (1999), Decidable fragments of simultaneous rigid reachability, in "26th International Colloquium on Automata, Languages, and Programming, ICALP'99," Lecture Notes in Computer Science, Springer-Verlag, Berlin.
6. Dauchet, M. (1993), Rewriting and tree automata, in "Term Rewriting (French Spring School of Theoretical Computer Science, Font Romeux, France" (H. Comon and J. P. Jouannaud, Eds.), Lecture Notes in Computer Science, Vol. 909, pp. 95-113, Springer-Verlag, Berlin.
7. Degtyarev, A., and Voronkov, A. (1995), "Reduction of Second-Order Unification to Simultaneous Rigid E-Unification," Technical Report 109, Computer Science Department, Uppsala University, Sweden.
8. Degtyarev, A., and Voronkov, A. (1996), The undecidability of simultaneous rigid E-unification, Theoret. Comput. Sci. 166, 291-300.
9. Degtyarev, A., Gurevich, Y., and Voronkov, A. (1996), Herbrand's theorem and equational reasoning: Problems and solutions, in "Bulletin of the European Association for Theoretical Computer Science," Vol. 60.
10. Degtyarev, A., Matiyasevich, Y., and Voronkov, A. (1996), Simultaneous rigid E-unification and related algorithmic problems, in "Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS'96), New Brunswick, NJ," pp. 494-502, IEEE Computer Society Press, Los Alamitos, CA.
11. Dowek, G. (1991), A second-order pattern matching algorithm for the cube of typed λ-calculi, in "Proceedings of Mathematical Foundations of Computer Science (MFCS '91), Kazimierz Dolny, Poland" (A. Tarlecki, Ed.), Lecture Notes in Computer Science, Vol. 520, pp. 151-160, Springer-Verlag, Berlin.
12. Dowek, G. (1994), Third order matching is decidable, Ann. Pure Appl. Logic 69, 135-155.
13. Farmer, W. M. (1988), A unification algorithm for second-order monadic terms, Ann. Pure Appl. Logic 39, 131-174.
14. Farmer, W. M. (1991), Simple second-order languages for which unification is undecidable, Theoret. Comput. Sci. 87, 173-214.
15. Gallier, J. H., Narendran, P., Plaisted, D., and Snyder, W. (1988), Rigid E-unification is NP-complete, in "Proc. IEEE Conf. on Logic in Computer Science, LICS'88," pp. 338-346.
16. Gallier, J. H., Raatz, S., and Snyder, W. (1987), Theorem proving using rigid E-unification: Equational matings, in "Proc. IEEE Conf. on Logic in Computer Science, LICS'87," pp. 338-346.
17. Ganzinger, H., Jacquemard, F., and Veanes, M. (1998), Rigid reachability, in "Advances in Computing Science - ASIAN'98, 4th Asian Computing Science Conference, Manila, The Philippines, December 1998, Proceedings" (J. Hsiang and A. Ohori, Eds.), Lecture Notes in Computer Science, Vol. 1538, pp. 4-21, Springer-Verlag, Berlin.
18. Goldfarb, W. D. (1981), The undecidability of the second-order unification problem, Theoret. Comput. Sci. 13, 225-230.
19. Gurevich, Y., and Veanes, M. (1999), Logic with equality: Partisan corroboration, and shifted pairing, Inform. and Comput. 152, 205-235.
20. Gurevich, Y., and Voronkov, A. (1997), Monadic simultaneous rigid E-unification and related problems, in "Automata, Languages and Programming, 24th International Colloquium, ICALP'97" (P. Degano, R. Corrieri, and A. Marchetti-Spaccamella, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 154-165, Springer-Verlag, Berlin.
21. Hindley, J., and Seldin, J. (1986), "Introduction to Combinatorics and λ-Calculus," Cambridge University Press, Cambridge, UK.
22. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
23. Huet, G. (1973), The undecidability of unification in third-order logic, Inform. and Control 22, 257-267.
24. Huet, G., and Lang, B. (1978), Proving and applying program transformations expressed with second-order patterns, Acta Inform. 11, 21-55.
25. Levy, J. (1996), Linear second-order unification, in "7th Int. Conf. on Rewriting Techniques and Applications, RTA'96, New Jersey," Lecture Notes in Computer Science, Vol. 1103, pp. 332-346, Springer-Verlag, Berlin.
26. Levy, J. (1998), Decidable and undecidable second-order unification problems, in "Rewriting Techniques and Applications" (T. Nipkow, Ed.), Lecture Notes in Computer Science, Vol. 1379, pp. 47-60, Springer-Verlag, Berlin.
27. Levy, J., and Veanes, M. (1998), On unification problems in restricted second-order languages, in "Annual Conference of the European Association for Computer Science Logic, CSL'98, Brno, Czech Republic."
28. Lucchesi, C. L. (1972), The undecidability of the unification problem for third-order languages, Technical Report CSRR 2059, Dept. of Applied Analysis and Computer Science, Univ. of Waterloo.
29. Makanin, G. S. (1977), The problem of solvability of equations in a free semigroup, Math. USSR Sbornik 32, 129-198.
30. Matiyasevich, Y. (1970), The diophantiness of recursively enumerable sets (in Russian), Soviet Math. Dokl., 279-282.
31. Niehren, J., Pinkal, M., and Ruhrberg, P. (1997), On equality up-to constraints over finite trees, context unification, and one-step rewriting, in "Proceedings of the 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia" (W. McCune, Ed.), Lecture Notes in Artificial Intelligence, Vol. 1249, pp. 34-48, Springer-Verlag, Berlin.
32. Padovani, V. (1996), "Filtrage d'ordre supérieur," Ph.D. thesis, Université Paris VII.
33. Pietrzykowski, T. (1973), A complete mechanization of second-order logic, J. Assoc. Comput. Mach. 20, 333-364.
34. Plaisted, D. A. (1995), "Special Cases and Substitutes for Rigid E-Unification," Technical Report MPI-I-95-2-010, Max-Planck-Institut für Informatik.
35. Prehofer, C. (1994), Decidable higher-order unification problems, in "12th International Conference on Automated Deduction, Nancy, France" (A. Bundy, Ed.), Lecture Notes in Artificial Intelligence, Vol. 814, pp. 635-649, Springer-Verlag, Berlin.
36. Schmidt-Schauß, M. (1995), "Unification of Stratified Second-Order Terms," Technical Report 12/94, Johan Wolfgang-Goethe-Universität, Frankfurt, Germany.
37. Schmidt-Schauß, M. (1999), "Decidability of Bounded Second Order Unification," Frank-report-11, Fachbereich Informatik, Johan Wolfgang-Goethe-Universität, Frankfurt, Germany.
38. Schmidt-Schauß, M., and Schulz, K. (1998), Decidability of context unification with two variables, in "UNIF 98, 12th International Workshop on Unification, Rome, June 29-July 1, 1998," in "Research Report," SI-98/8, University of Rome, pp. 71-74.
39. A more detailed version appears in CADE'99.
40. Schubert, A. (1997), Second-order unification and type inference for church-style polymorphism, Technical Report TR 97-02(239), Institute of Informatics, Warsaw University.
41. Schubert, A. (1998), Second-order unification and type inference for Church-style polymorphism, in "Conference Record of POPL'98: The 25TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego," pp. 279-288, ACM Press, New York.
42. Schulz, K. U. (1991), "Makanin's Algorithm, Two Improvements and a Generalization," Technical Report CIS-Bericht-91-39, Centrum für Informations und Sprachverarbeitung, Universität München.
43. Veanes, M. (1996), "Uniform Representation of Recursively Enumerable Sets with Simultaneous Rigid E-Unification," UPMAIL Technical Report 126, Uppsala University, Computing Science Department.
44. Veanes, M. (1998), The relation between second-order unification and simultaneous rigid E-unification, in "Proc. Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 21-24, 1998, Indianapolis, Indiana (LICS'98)," pp. 264-275, IEEE Computer Society Press, Los Alamitos, CA.
45. Voronkov, A. (1998), Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem, Theoret. Comput. Sci., in press.
46. Zhezherun, A. P. (1979), Decidability of the unification problem for second-order languages with unary functional symbols, Kibernetika (Kiev) 5, 120-125.
47. [Translated as Cybernetics 15, 735-741, 1980]