Currying second-order unification problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2378, Issue , 2002, Pages 326-339

  Levy, Jordi ^a   Villaret, Mateu ^b  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b IMA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BETA-REDUCTION; BINARY FUNCTIONS; BINARY SYMBOLS; CONTEXT UNIFICATIONS; HIGHER-ORDER UNIFICATION; SECOND ORDERS; UNIFICATION PROBLEM; VARIABLE APPLICATIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84947216944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_23     Document Type: Conference Paper

References (16)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1998.
2. Nikolaj Bjorner and César Muñoz. Absoulte explicit unification. In Proceedings of the 11th Int. Conf. on Rewriting Techniques and Applications (RTA’00), volume 1833 of LNCS, pages 31–46, Norwich, UK, 2000.
3. Hubert Comon. Completion ofrewrite systems with membership constraints. Journal of Symbolic Computation, 25(4):397–453, 1998.
4. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. Information and Computation, 157:183–235, 2000.
5. W. M. Farmer. Simple second-order languages for wich unification is undecidable. Theoretical Computer Science, 87:173–214, 1991.
6. Harald Ganzinger, Robert Nieuwenhuis, and Pilar Nivela. Context trees. In Proceedings of the First Int. Conf. on Automated Reasoning (IJCAR 2001), volume 2083 of LNCS, pages 242–256, Siena, Italy, 2001.
7. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981.
8. Jordi Levy. Linear second-order unification. In Proceedings of the 7th Int. Conf. on Rewriting Techniques and Applications (RTA’96), volume 1103 of LNCS, pages 332–346, New Brunsbick, New Jersey, 1996.
9. Jordi Levy and Margus Veanes. On the undecidability of second-order unification. Information and Computation, 159:125–150, 2000.
10. Jordi Levy and Mateu Villaret. Context unification and traversal equations. In Proceedings of the 12th Int. Conf. on Rewriting Techniques and Applications (RTA’01), volume 2051 of LNCS, pages 167–184, Utrecht, The Netherlands, 2001.
11. G. S. Makanin. The problem ofsolv ability ofequations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.
12. Wojciech Plandowski. Satisfiability of word equations with constants is in pspace. In Proceedings of the 40th Annual Symposioum on Foundations of Computer Science, FOCS’99, pages 495–500, New York, NY, USA, 1999.
13. Manfred Schmidt-Schauß. An algorithm for distributive unification. In Proceedings of the 7th Int. Conf. on Rewriting Techniques and Applications (RTA’96), volume 1103 of LNCS, pages 287–301, New Jersey, USA, 1996.
14. Manfred Schmidt-Schauß. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111–148, 1998.
15. Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity ofminimal solutions ofcon text equations. In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA’98), volume 1379 of LNCS, pages 61–75, Tsukuba, Japan, 1998.
16. Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In Proceedings of the 16th Int. Conf. on Automated Deduction (CADE-16), LNAI, pages 67–81, 1999.