Abstract
The Curry form of a term, like f(a, b), allows us to write it, using just a single binary function symbol, as @(@(f,a),b). Using this technique we prove that the signature is not relevant in second-order unification, and conclude that one binary symbol is enough.
By currying variable applications, like X(a), as @(X,a), we can transform second-order terms into first-order terms, but we have to add beta-reduction as a theory. This is roughly what it is done in explicit unification. We prove that by currying only constant applications we can reduce second-order unification to second-order unification with just one binary function symbol. Both problems are already known to be undecidable, but applying the same idea to context unification, for which decidability is still unknown, we reduce the problem to context unification with just one binary function symbol.
We also discuss about the difficulties of applying the same ideas to third or higher order unification.
This research has been partially supported by the CICYT Research Projects DENOC (BFM2000-1054-C02), LOGFAC, and TIC2001-2392-C03-01
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, P.-L. Curien, and J.J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1998.
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.
Hubert Comon. Completion of rewrite systems with membership constraints. Journal of Symbolic Computation, 25(4):397–453, 1998.
G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. Information and Computation, 157:183–235, 2000.
W. M. Farmer. Simple second-order languages for wich unification is un-decidable. Theoretical Computer Science, 87:173–214, 1991.
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.
W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981.
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.
Jordi Levy and Margus Veanes. On the undecidability of second-order unification. Information and Computation, 159:125–150, 2000.
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.
G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.
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.
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.
Manfred Schmidt-Schauß. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111–148, 1998.
Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context 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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levy, J., Villaret, M. (2002). Currying Second-Order Unification Problems. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-45610-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43916-5
Online ISBN: 978-3-540-45610-0
eBook Packages: Springer Book Archive