Abstract
Computing with data values that are some kind of trees —finite, infinite, rational— is at the core of declarative programming, either logic, functional, or functional-logic. Understanding the logic of trees is therefore a fundamental question with impact in different aspects, like language design, including constraint systems or constructive negation, or obtaining methods for verifying and reasoning about programs. The theory of true equality over finite or infinite trees is quite well-known. In particular, a seminal paper by Maher proved its decidability and gave a complete axiomatization of the theory. However, the sensible notion of equality for functional and functional-logic languages with a lazy evaluation regime is strict equality, a computable approximation of true equality for possibly infinite and partial trees. In this paper, we investigate the first-order theory of strict equality, arriving to remarkable and not obvious results: the theory is again decidable and admits a complete axiomatization, not requiring predicate symbols other than strict equality itself. Besides, the results stem from an effective —taking into account the intrinsic complexity of the problem— decision procedure that can be seen as a constraint solver for general strict equality constraints. As a side product of our results, we obtain that the theories of strict equality over finite and infinite partial trees, respectively, are elementarily equivalent.
This work has been partially supported by the Spanish projects TIN2008-06622-C03-01, S-0505/TIC/0407, S2009TIC-1465, UCM-BSCH-GR58/ 08-910502, TIN2007-66523 and GIU07/35.
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
Álvez, J., López-Fraguas, F.J.: A complete axiomatization of strict equality over infinite trees. Technical Report SIC-3-09, UCM, Madrid (2009), http://gpd.sip.ucm.es/fraguas/papers/TR_SIC_3_09.pdf
Arenas-Sánchez, P., Gil-Luezas, A., López-Fraguas, F.J.: Combining lazy narrowing with disequality constraints. In: Hermenegildo, M.V., Penjam, J. (eds.) PLILP 1994. LNCS, vol. 844, pp. 385–399. Springer, Heidelberg (1994)
Arias, E.J.G., Mariño-Carballo, J., Poza, J.M.R.: A proposal for disequality constraints in Curry. Electr. Notes Theor. Comput. Sci. 177, 269–285 (2007)
Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Clark, K.L., Tärnlund, S.A. (eds.) FGCS 1984, pp. 85–99 (1984)
Comon, H., Lescanne, P.: Equational problems and disunification. Journal of Symbolic Computation 7(3/4), 371–425 (1989)
Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic 48(1), 1–79 (1990)
Djelloul, K., Dao, T.-B.-H., Frühwirth, T.W.: Theory of finite or infinite trees revisited. TPLP 8(4), 431–489 (2008)
Hanus, M. (ed.): Curry: An integrated functional logic language (March 2006), http://www.informatik.uni-kiel.de/~curry/report.html
López-Fraguas, F.J.: Programación Funcional y Lógica con Restricciones. PhD thesis, Univ. Complutense Madrid (1994) (in Spanish)
López-Fraguas, F.J., Sánchez-Hernández, J.: Failure and equality in functional logic programming. Electr. Notes Theor. Comput. Sci. 86(3) (2003)
López-Fraguas, F., Sánchez-Hernández, J.: \(\mathcal{TOY}\): A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244–247. Springer, Heidelberg (1999)
López-Fraguas, F., Sánchez-Hernández, J.: A proof theoretic approach to failure in functional logic programming. TPLP 4(1, 2), 41–74 (2004)
Maher, M.: Complete axiomatizations of the algebras of finite, rational and infinite trees. Technical report, IBM T.J. Watson Research Center (1988), http://www.cse.unsw.edu.au/~mmaher/pubs/trees/axiomatizations.pdf
Maher, M.J.: Complete axiomatizations of the algebras of finite, rational and infinite trees. In: LICS 1988, pp. 348–357. IEEE Computer Society, Los Alamitos (1988)
Peyton Jones, S.L. (ed.): Haskell 98 Language and Libraries. The Revised Report. Cambridge Univ. Press, Cambridge (2003)
Reiter, R.: On closed world data bases. In: Logic and Data Bases, pp. 55–76 (1978)
Vorobyov, S.G.: An improved lower bound for the elementary theories of trees. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 275–287. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Álvez, J., López-Fraguas, F.J. (2010). A Complete Axiomatization of Strict Equality. In: Blume, M., Kobayashi, N., Vidal, G. (eds) Functional and Logic Programming. FLOPS 2010. Lecture Notes in Computer Science, vol 6009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12251-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12251-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12250-7
Online ISBN: 978-3-642-12251-4
eBook Packages: Computer ScienceComputer Science (R0)