Abstract
The new generic scheme CFLP(\(\mathcal{D}\)) has been recently proposed in [14] as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain \(\mathcal{D}\). Further, [15] presented a Constrained Lazy Narrowing Calculus \(CLNC(\mathcal{D})\) as a convenient computation mechanism for solving goals for CFLP(\(\mathcal{D}\))-programs, which was proved sound and strongly complete with respect to CFLP(\(\mathcal{D}\))’s semantics. Now, in order to provide a formal foundation for an efficient implementation of goal solving methods in existing systems such as Curry [8] and \(\mathcal{TOY}\) [13,6], this paper enriches the CFLP(\(\mathcal{D}\)) framework by presenting an optimization of the CLNC(\(\mathcal{D}\)) calculus by means of definitional trees to efficiently control the computation. We prove that this new Constrained Demanded Narrowing Calculus CDNC(\(\mathcal({D}\)) preserves the soundness and completeness properties of CLNC(\(\mathcal{D}\)) and maintains the good properties shown for needed and demand-driven narrowing strategies [4,11,17].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 143–157. Springer, Heidelberg (1992)
Antoy, S.: Optimal non-deterministic functional logic computations. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol. 1298, pp. 16–30. Springer, Heidelberg (1997)
Antoy, S.: Constructor-based conditional narrowing. In: Proc. PPDP 2001, pp. 199–206. ACM Press, New York (2001)
Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. Journal of the ACM 47(4), 776–822 (2000)
Caballero, R., Rodríguez-Artalejo, M.: \(\mathcal{DDT}\): A Declarative Debugging Tool for Functional Logic Languages. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 70–84. Springer, Heidelberg (2004)
Fernández, A.J., Hortalá-González, M.T., Sáenz Pérez, F.: \(\mathcal{TOY(FD)}\). User’s Manual, October 27 (2003), System available at http://www.lcc.uma.es/~afdez/cflpfd/
Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, 583–628 (1994)
Hanus, M. (ed.): Curry: an Integrated Functional Logic Language, Version 0.8, April 15 (2003), http://www-i2.informatik.uni-kiel.de/~curry/
Hanus, M., Prehofer, C.: Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming 9(1), 33–75 (1999)
Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The Semantics of Constraint Logic Programs. Journal of Logic Programming 37(1-3), 1–46 (1998)
Loogen, R., López-Fraguas, F.J., Rodríguez-Artalejo, M.: A demand driven computation strategy for lazy narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol. 714, pp. 184–200. Springer, Heidelberg (1993)
López-Fraguas, F.J.: A General Scheme for Constraint Functional Logic Programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 213–227. Springer, Heidelberg (1992)
López-Fraguas, F.J., 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.J., Rodríguez-Artalejo, M., del Vado-Vírseda, R.: Constraint Functional Logic Programming Revisited. In: International Workshop on Rewriting Logic and its Applications WRLA 2004. Elsevier ENTCS series, vol. 117, pp. 5–50 (2005)
López-Fraguas, F.J., Rodríguez-Artalejo, M., del Vado-Vírseda, R.: A lazy narrowing calculus for declarative constraint programming. In: Prof of the 6th International Conference on PPDP 2004, pp. 43–54. ACM Press, New York (2004)
Marin, M., Ida, T., Suzuki, T.: Cooperative Constraint Functional Logic Programming. In: Int. Symposium on IPSE 2000, November 1–2, 2000, pp. 223–230 (2000)
del Vado Vírseda, R.: A Demand-driven Narrowing Calculus with Overlapping Definitional Trees. In: 5th Int. Conference on PPDP 2003, pp. 213–227. ACM Press, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
del Vado Vírseda, R. (2005). Declarative Constraint Programming with Definitional Trees. In: Gramlich, B. (eds) Frontiers of Combining Systems. FroCoS 2005. Lecture Notes in Computer Science(), vol 3717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559306_10
Download citation
DOI: https://doi.org/10.1007/11559306_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29051-3
Online ISBN: 978-3-540-31730-2
eBook Packages: Computer ScienceComputer Science (R0)