{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:24:38Z","timestamp":1761945878027,"version":"build-2065373602"},"reference-count":104,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2007,2,24]],"date-time":"2007-02-24T00:00:00Z","timestamp":1172275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,4,4]]},"DOI":"10.1007\/s10990-007-9002-4","type":"journal-article","created":{"date-parts":[[2007,2,24]],"date-time":"2007-02-24T03:24:07Z","timestamp":1172287447000},"page":"73-122","source":"Crossref","is-referenced-by-count":16,"title":["A new generic scheme for functional logic programming with constraints"],"prefix":"10.1007","volume":"20","author":[{"given":"Francisco J.","family":"L\u00f3pez Fraguas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Rodr\u00edguez Artalejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael del Vado","family":"V\u00edrseda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,24]]},"reference":[{"key":"9002_CR1","unstructured":"Abeng\u00f3zar-Carneros, M., Arenas-S\u00e1nchez, P., Caballero-Rold\u00e1n, R., Gil-Luezas, A., Gonz\u00e1lez-Moreno, J.C., Leach-Albert, J., L\u00f3pez-Fraguas, F.J., Mart\u00ed-Oliet, N., Molina-Bravo, J.M., Pimentel-S\u00e1nchez, E., Rodr\u00edguez-Artalejo, M., Rold\u00e1n-Garc\u00eda, M.M., Ruz-Ortiz, J.J., S\u00e1nchez-Hern\u00e1ndez, J.: TOY: A Multiparadigm Declarative Language. Version 2.0. Technical Report, Dpto. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, February (2002). System and documentation available at http:\/\/toy.sourceforge.net."},{"key":"9002_CR2","doi-asserted-by":"crossref","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. In: Proc. ACM Symp. on Principles of Programming Languages (POPL\u201994), pp. 268\u2013279. ACM Press, Portland (1994)","DOI":"10.1145\/174675.177899"},{"key":"9002_CR3","doi-asserted-by":"crossref","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 74(4), 776\u2013822 (2000)","DOI":"10.1145\/347476.347484"},{"key":"9002_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. A\u00eft-Kaci","year":"1994","unstructured":"A\u00eft-Kaci, H., Podelski, A.: A feature constraint system for logic programming with entailment. Theor. Comput. Sci. 122, 263\u2013283 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR5","doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Logic programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Chapter 10, pp. 493\u2013574. Elsevier and The MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"9002_CR6","unstructured":"Apt, K.R., Gabbrielli, M.: Declarative interpretations reconsidered. In: Proc. Int. Conf. on Logic Programming (ICLP\u201994), Santa Margherita Ligure, pp. 74\u201389. The MIT Press (1994)"},{"key":"9002_CR7","doi-asserted-by":"crossref","unstructured":"Arenas-S\u00e1nchez, P., Gil-Luezas, A., L\u00f3pez-Fraguas, F.J.: Combining lazy narrowing with disequality constraints. In: Proc. Int. Symp. on Programming Language Implementation and Logic Programming (PLILP\u201994), pp. 385\u2013399. Springer LNCS 844 (1994)","DOI":"10.1007\/3-540-58402-1_27"},{"key":"9002_CR8","doi-asserted-by":"crossref","unstructured":"Arenas-S\u00e1nchez, P., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: Embedding multiset constraints into a lazy functional logic language. In: Proc. Int. Symp. on Programming Language Implementation and Logic Programming (PLILP\u201998), held jointly with the 6th Int. Conf. on Algebraic and Logic Programming (ALP\u201998), pp. 429\u2013444. Pisa, Springer LNCS 1490 (1998)","DOI":"10.1007\/BFb0056631"},{"key":"9002_CR9","doi-asserted-by":"crossref","unstructured":"Arenas-S\u00e1nchez, P., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: Functional plus logic programming with built-in and symbolic constraints. In: Proc. Int. Conf. on Principles and Practice of Declarative Programming (PPDP\u201999), pp. 152\u2013169. Paris, Springer LNCS 1702 (1999)","DOI":"10.1007\/10704567_9"},{"key":"9002_CR10","doi-asserted-by":"crossref","unstructured":"Arenas-S\u00e1nchez, P., Rodr\u00edguez-Artalejo, M.: A semantic framework for functional logic programming with algebraic polymorphic types. In: Proc. Int. Joint Conference on Theory and Practice of Software Development (TAPSOFT\u201997), pp. 453\u2013464. Springer LNCS 1214 (1997)","DOI":"10.1007\/BFb0030618"},{"key":"9002_CR11","doi-asserted-by":"crossref","unstructured":"Arenas-S\u00e1nchez, P., Rodr\u00edguez-Artalejo, M.: A lazy narrowing calculus for functional logic programming with algebraic polymorphic types. In: Proc. Int. Symp. on Logic Programming (ILPS\u201997), pp. 53\u201368. The MIT Press (1997)","DOI":"10.1007\/BFb0030618"},{"key":"9002_CR12","first-page":"185","volume":"12","author":"P. Arenas-S\u00e1nchez","year":"2001","unstructured":"Arenas-S\u00e1nchez, P., Rodr\u00edguez-Artalejo, M.: A general framework for lazy functional logic programming with algebraic polymorphic types. Theory Pract. Log. Program. 1(2), 185\u2013245 (2001)","journal-title":"Theory Pract. Log. Program."},{"key":"9002_CR13","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"9002_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0743-1066(95)00033-G","volume":"24","author":"R. Backofen","year":"1995","unstructured":"Backofen, R.: A complete axiomatization of a theory with feature and arity constraints. J. Log. Program. 24(1&2), 37\u201371 (1995)","journal-title":"J. Log. Program."},{"key":"9002_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(94)00188-O","volume":"146","author":"R. Backofen","year":"1995","unstructured":"Backofen, R., Smolka, G.: A complete and recursive feature theory. Theor. Comput. Sci. 146, 243\u2013268 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19&20","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-Semantics approach: Theory and applications. J. Log. Program. 19&20, 149\u2013197 (1994)","journal-title":"J. Log. Program."},{"key":"9002_CR17","doi-asserted-by":"crossref","unstructured":"Caballero, R., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: Theoretical foundations for the declarative debugging of lazy functional logic programs. In: Proc. of the 5th International Symposium on Functional and Logic Programming (FLOPS\u20192001), pp. 170\u2013184. Springer LNCS 2024 (2001)","DOI":"10.1007\/3-540-44716-4_11"},{"key":"9002_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S1571-0661(04)80349-9","volume":"64","author":"R. Caballero","year":"2002","unstructured":"Caballero, R., Rodr\u00edguez-Artalejo, M.: A declarative debugging system for lazy functional logic programs. Electronic Notes Theor. Comput. Sci. 64, 63 (2002)","journal-title":"Electronic Notes Theor. Comput. Sci."},{"key":"9002_CR19","doi-asserted-by":"crossref","unstructured":"Caballero R., Rodr\u00edguez-Artalejo, M.: DDT: A declarative debugging tool for functional logic languages. In: Proc. of the 7th International Symposium on Functional and Logic Programming (FLOPS\u20192004), pp. 70\u201384. Springer LNCS 2988 (2004)","DOI":"10.1007\/978-3-540-24754-8_7"},{"key":"9002_CR20","doi-asserted-by":"crossref","unstructured":"Caballero, R., Rodr\u00edguez-Artalejo, M., del Vado-V\u00edrseda, R.: Declarative diagnosis of wrong answers in constraint functional-logic programming. In: Proc. of the Twenty Second Interntational Conference on Logic Programming (ICLP 2006), LNCS vol. 4079, Springer-Verlag (2006)","DOI":"10.1007\/11799573_31"},{"key":"9002_CR21","unstructured":"Clark, K.L.: Predicate logic as a computational formalism. Research Report DOC 79\/59, Imperial College, Department of Computing, London (1979)"},{"key":"9002_CR22","unstructured":"Colmerauer, A.: Prolog and infinite trees. In: Clark, K.L., T\u00e4rnlud, S.A. (eds.) Logic Programming, pp. 153\u2013172. Academic Press (1982)"},{"key":"9002_CR23","unstructured":"Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Proc. of the 2nd International Conference on Fifth Generation Computer Systems, pp. 85\u201389 (1984)"},{"key":"9002_CR24","doi-asserted-by":"crossref","unstructured":"Damas, L., Milner, R.: Principal type schemes for functional programs. In: Proc. ACM Symp. on Principles of Programming Languages (POPL\u201982), pp. 207\u2013212. ACM Press (1982)","DOI":"10.1145\/582153.582176"},{"key":"9002_CR25","unstructured":"Darlington, J., Guo, Y.K.: Constraint functional programming. Technical Report, Imperial College, November (1989)"},{"key":"9002_CR26","doi-asserted-by":"crossref","unstructured":"Darlington, J., Guo, Y.K.: Constraint equational deduction. In: Proc. of 2nd Int. Workshop on Conditional and Typed Rewriting Systems (CTRS\u201990), pp. 11\u201314. Springer LNCS 516 (1991)","DOI":"10.1007\/3-540-54317-1_111"},{"key":"9002_CR27","doi-asserted-by":"crossref","unstructured":"Darlington, J., Guo, Y.K., Pull, H.: Introducing constraint functional logic programming. PHOENIX Seminar and Workshop on Declarative Programming (DP\u201991), Springer Workshops in Computing, pp. 20\u201334, (1992)","DOI":"10.1007\/978-1-4471-3794-8_2"},{"key":"9002_CR28","unstructured":"Darlington, J., Guo, Y.K., Pull, H.: A new perspective on the integration of functional and logic languages. In: Proc. of the Int. Conf. on Fifth Generation Computer Systems (FGCS\u201992), pp. 682\u2013693. IOS Press (1992)"},{"key":"9002_CR29","unstructured":"DeGroot, D., Lindstrom, G. (eds.): Logic Programming: Functions, Relations and Equations. Prentice-Hall, Englewood Cliffs (1986)"},{"key":"9002_CR30","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwenm, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Chapter 6, pp. 243\u2013320. Elsevier and The MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"9002_CR31","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Okada, M.: A rationale for conditional equational programming. Theor. Comput. Sci. 75, 111\u2013138 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR32","doi-asserted-by":"crossref","unstructured":"Est\u00e9vez-Mart\u00edn, S., del Vado-V\u00edrseda, R.: Designing an efficient computation strategy in FD using definitional trees. In: Proc. of the International Workshop on Curry and Functional Logic Programming (WCFLP 2005), pp. 23-31 (2005)","DOI":"10.1145\/1085099.1085105"},{"key":"9002_CR33","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"693","author":"M. Falaschi","year":"1989","unstructured":"Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: Declarative modeling of the operational behavior of logic languages. Theor. Comput. Sci. 69(3), 289\u2013318 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR34","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/inco.1993.1015","volume":"1021","author":"M. Falaschi","year":"1993","unstructured":"Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: A model-theoretic reconstruction of the operational semantics of logic programs. Inf. Comput. 102(1), 86\u2013113 (1993)","journal-title":"Inf. Comput."},{"key":"9002_CR35","unstructured":"Fay, M.J.: First-order unification in an equational theory. In: Proc. Workshop on Automated Deduction (CADE\u201979), pp. 161\u2013177. Academic Press (1979)"},{"key":"9002_CR36","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, A.J., Hortal\u00e1-Gonz\u00e1lez, M.T., S\u00e1enz P\u00e9rez, F.: Solving combinatorial problems with a constraint functional logic language. In: Proc. 5th International Symposium on Principles and Practice of Declarative Languages (PADL\u20192003), pp. 320\u2013338. Springer LNCS 2562 (2003)","DOI":"10.1007\/3-540-36388-2_22"},{"key":"9002_CR37","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, A.J., Hortal\u00e1-Gonz\u00e1lez, M.T., S\u00e1enz P\u00e9rez, F.: TOY(FD): Sketch of operational semantics.In: Proc. 9th International Conference on Principles and Practice of Constraint Programming (CP\u201903), pp. 827\u2013831. Springer LNCS 2833 (2003)","DOI":"10.1007\/978-3-540-45193-8_61"},{"key":"9002_CR38","unstructured":"Fern\u00e1ndez, A.J., Hortal\u00e1-Gonz\u00e1lez, M.T., S\u00e1enz P\u00e9rez, F.: TOY(FD): Version 0.8 User Manual, October 27, (2003). System and documentation available at http:\/\/toy.sourceforge.net."},{"key":"9002_CR39","unstructured":"Gabbrielli, M., Levi, G.: Modeling answer constraints in constraint logic programs. In: Proc. of the Eigth Int. Conf. on Logic Programming (ICLP\u201991), pp. 238\u2013252. The MIT Press (1991)"},{"key":"9002_CR40","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1093\/logcom\/5.2.133","volume":"52","author":"M. Gabbrielli","year":"1995","unstructured":"Gabbrielli, M., Dore, G.M., Levi, G.: Observable semantics for constraint logic programs. J. Logic Comput. 5(2), 133\u2013171 (1995)","journal-title":"J. Logic Comput."},{"key":"9002_CR41","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: A rewriting logic for declarative programming. In: Proc. European Symp. on Programming (ESOP\u201996), pp. 156\u2013172. Springer LNCS 1058 (1996)","DOI":"10.1007\/3-540-61055-3_35"},{"key":"9002_CR42","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"401","author":"J.C. Gonz\u00e1lez-Moreno","year":"1999","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. Logic Program. 40(1), 47\u201387 (1999)","journal-title":"J. Logic Program."},{"key":"9002_CR43","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., Rodr\u00edguez-Artalejo, M.: A higher order rewriting logic for functional logic programming. In: Proc. Int. Conf. on Logic Programming, pp. 153\u2013167. The MIT Press (1997)","DOI":"10.7551\/mitpress\/4299.003.0017"},{"key":"9002_CR44","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., Rodr\u00edguez-Artalejo, M.: Polymorphic types in functional logic programming. FLOPS\u201999 special issue of the Journal of Functional and Logic Programming (2001). http:\/\/danae.uni-muenster.de\/lehre\/kuchen\/JFLP."},{"key":"9002_CR45","doi-asserted-by":"crossref","unstructured":"Gunter, C.A., Scott, D.: Semantic domains. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Chapter 6, pp. 633\u2013674. Elsevier and The MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50017-2"},{"key":"9002_CR46","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The integration of functions into logic programming: from theory to practice. J. Logic Program. 19&20, 583\u2013628 (1994)","journal-title":"J. Logic Program."},{"key":"9002_CR47","doi-asserted-by":"crossref","unstructured":"Hanus M.: A unified computation model for functional and logic programming. In: Proc. 24st ACM Symposium on Principles of Programming Languages (POPL\u201997), pp. 80\u201393. ACM Press (1997)","DOI":"10.1145\/263699.263710"},{"key":"9002_CR48","unstructured":"Hanus, M.: Curry: an Integrated Functional Logic Language, Version 0.8.2, March 28 (2006). http:\/\/www-i2.informatik.uni-kiel.de\/~curry\/."},{"key":"9002_CR49","unstructured":"Henz, M., Smolka, G., W\u00fcrtz, J.: Object-oriented concurrent constraint programming in Oz. In: Saraswat, V., Hentenryck, P.V., (eds.) Principles and Practice of Constraint Programming, Chapter 2, pp. 27\u201348. The MIT Press (1995)"},{"key":"9002_CR50","doi-asserted-by":"crossref","unstructured":"Hullot, J.M.: Canonical forms and unification. In: Proc. Conf. on Automated Deduction (CADE\u201980), pp. 318\u2013334. Springer LNCS 87 (1980)","DOI":"10.21236\/ADA087640"},{"key":"9002_CR51","unstructured":"Hussmann, H.: Nichtdeterministische Algebraische Spezifikationen. Ph. D. Thesis, University of Passau (1988)"},{"key":"9002_CR52","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(92)90026-Y","volume":"12","author":"H. Hussmann","year":"1992","unstructured":"Hussmann, H.: Nondeterministic algebraic specifications and nonconfluent term rewriting. J. Logic Program. 12, 237\u2013255 (1992)","journal-title":"J. Logic Program."},{"key":"9002_CR53","doi-asserted-by":"crossref","unstructured":"Hussmann, H.: Non-determinism in Algebraic Specifications and Algebraic Programs. Birkh\u00e4user Verlag (1993)","DOI":"10.1007\/978-1-4684-6834-2"},{"key":"9002_CR54","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proc. ACM Symp. on Principles of Programming Languages (POPL\u201987), pp. 111\u2013119. ACM Press (1987)","DOI":"10.1145\/41625.41635"},{"key":"9002_CR55","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19&20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. J. Logic Program. 19&20, 503\u2013581 (1994)","journal-title":"J. Logic Program."},{"issue":"1\u20133","key":"9002_CR56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. J. Logic Program. 37(1\u20133), 1\u201346 (1998)","journal-title":"J. Logic Program."},{"key":"9002_CR57","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"143","author":"J. Jaffar","year":"1992","unstructured":"Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14(3), 339\u2013395 (1992)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9002_CR58","first-page":"9","volume":"43","author":"C. Kirchner","year":"1990","unstructured":"Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue Fran\u00e7aise d\u2019Intelligence Artificielle 4(3), 9\u201352 (1990)","journal-title":"Revue Fran\u00e7aise d\u2019Intelligence Artificielle"},{"key":"9002_CR59","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 2\u2013116. Oxford University Press (1992)"},{"key":"9002_CR60","unstructured":"Kuchen, H., L\u00f3pez-Fraguas, F.J., Moreno-Navarro, J.J., Rodr\u00edguez-Artalejo, M.: Implementing a lazy functional logic language with disequality constraints. In: Proc. Joint Int. Conf. and Symposium on Logic Programming (JICSLP\u201992), pp. 207\u2013221. The MIT Press (1992)"},{"key":"9002_CR61","unstructured":"Lankford, D.S.: Canonical inference. Technical Report ATP-32, Department of Mathematics and Computer Science, University of Texas at Austin (1975)"},{"key":"9002_CR62","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. 2nd edn. Springer Verlag (1987)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"9002_CR63","doi-asserted-by":"crossref","unstructured":"Loogen, R., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: A demand driven computation strategy for lazy narrowing. In: Proc. Int. Symp. on Programming Language Implementation and Logic Programming (PLILP\u201993), pp. 184\u2013200. Springer LNCS 714 (1993)","DOI":"10.1007\/3-540-57186-8_79"},{"key":"9002_CR64","unstructured":"L\u00f3pez-Fraguas, F.J.: A general scheme for constraint functional logic programming. In: Proc. Int. Conf. on Algebraic and Logic Programming (ALP\u201992), pp. 213\u2013227. Springer LNCS 632 (1992)"},{"key":"9002_CR65","unstructured":"L\u00f3pez-Fraguas, F.J.: Programaci\u00f3n Funcional y L\u00f3gica con Restricciones. Ph.D. Thesis, Univ. Complutense Madrid (1994)"},{"key":"9002_CR66","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M., del Vado V\u00edrseda, R.: Constraint functional logic programming revisited. In: Proc. of the 5th International Workshop on Rewriting Logic and its Applications (WRLA\u20192004), Electronic Notes in Theoretical Computer Science, vol. 117, pp. 5\u201350 (2005)","DOI":"10.1016\/j.entcs.2004.06.030"},{"key":"9002_CR67","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M., del Vado V\u00edrseda, R.: A lazy narrowing calculus for declarative constraint programming. In: Proc. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP\u201904), pp. 43\u201354 . ACM Press (2004)","DOI":"10.1145\/1013963.1013972"},{"key":"9002_CR68","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: Disequalities may help to narrow. In: Proc. APPIA-GULP-PRODE\u201999, pp. 89\u2013104 (1999)"},{"key":"9002_CR69","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: TOY: A multiparadigm declarative system. In: Proc. RTA\u201999, pp. 244\u2013247. Springer LNCS 1631 (1999)","DOI":"10.1007\/3-540-48685-2_19"},{"issue":"3","key":"9002_CR70","first-page":"21","volume":"863","author":"F.J. L\u00f3pez-Fraguas","year":"2003","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: Failure and equality in functional logic programming. Electronic Notes in Theor. Comput. Sci. 86(3), 21 (2003)","journal-title":"Electronic Notes in Theor. Comput. Sci."},{"key":"9002_CR71","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S1471068403001728","volume":"41","author":"F.J. L\u00f3pez-Fraguas","year":"2004","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: A proof theoretic approach to failure in functional logic programming. Theory Pract. Logic Program. 4(1), 41\u201374 (2004)","journal-title":"Theory Pract. Logic Program."},{"key":"9002_CR72","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Complete axiomatization of the algebras of finite, rational and infinite trees. In: Proc. of the Third Annual Symposium of Logic in Computer Science (LICS\u201988), pp. 348\u2013357. IEEE Computer Society Press (1988)","DOI":"10.1109\/LICS.1988.5132"},{"key":"9002_CR73","unstructured":"Mandel, L.: Constrained Lambda Calculus. Aachen Verlag Shaker (1995)"},{"key":"9002_CR74","unstructured":"Marin, M.: Functional Logic Programming with Distributed Constraint Solving. Ph. D. Thesis, Johannes Kepler Universit\u00e4t Linz (2000)"},{"key":"9002_CR75","unstructured":"Marin, M., Ida, T., Schreiner, W.: CFLP: a mathematica implementation of a distributed constraint solving system. In: Third International Mathematical Symposium (IMS\u201999), p. 10. Hagenberg, Austria, August 23\u201325 (1999)"},{"key":"9002_CR76","doi-asserted-by":"crossref","unstructured":"Marin, M., Ida, T., Suzuki, T.: Cooperative constraint functional logic programming. In: International Symposium on Principles of Software Evolution (IPSE\u20192000), pp. 223\u2013230, November 1\u20132 (2000)","DOI":"10.1109\/ISPSE.2000.913241"},{"key":"9002_CR77","doi-asserted-by":"crossref","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints, An Introduction. The MIT Press (1998)","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"9002_CR78","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"2852","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theor. Comput. Sci. 285(2), 121\u2013154 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR79","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96, 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"9002_CR80","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Appl. Algebra Eng. Commun. Comput. 5, 213\u2013253 (1994)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9002_CR81","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sciences 17, 348\u2013375 (1978)","journal-title":"J. Comput. Syst. Sciences"},{"key":"9002_CR82","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF00267044","volume":"22","author":"B. M\u00d6ller","year":"1985","unstructured":"M\u00f6ller, B.: On the algebraic specification of infinite objects - ordered and continuous models of algebraic types. Acta Inform. 22, 537\u2013578 (1985)","journal-title":"Acta Inform."},{"key":"9002_CR83","doi-asserted-by":"crossref","unstructured":"M\u00fcck, A., Streicher, T.: A tiny constrain functional logic language and its continuation semantics. In: Proc. European Symp. on Programming (ESOP\u201994), pp. 439\u2013453. Springer LNCS 788 (1994)","DOI":"10.1007\/3-540-57880-3_29"},{"key":"9002_CR84","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S1571-0661(04)80354-2","volume":"64","author":"M. Palomino Tarjuelo","year":"2002","unstructured":"Palomino Tarjuelo, M.: Comparing meseguer\u2019s rewriting logic with the logic CRWL. Electronic Notes in Theoretical Computer Science 64, 22 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9002_CR85","doi-asserted-by":"crossref","unstructured":"Palomino Tarjuelo, M.: A Comparison between two logical formalism for rewriting. In: Falaschi, M., Maher, M. (eds.) Multiparadigm Languages and Constraint Programming (special issue). To appear in Theory and Practice of Logic Programming","DOI":"10.1017\/S1471068406002845"},{"key":"9002_CR86","unstructured":"Robinson, J.A., Sibert, E.E.: LOGLISP: Motivation, design and implementation. In: Clark, K.L., T\u00e4rnlund, S.A (eds.) Logic Programming, pp. 299\u2013313. Academic Press (1982)"},{"key":"9002_CR87","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Artalejo, M.: Functional and constraint logic programming. In: Comon, H., March\u00e9, C., Treinen, R. (eds.) Constraints in Computational Logics, Theory and Applications. Revised Lectures of the International Summer School CCL\u201999, Chapter 5, pp. 202\u2013270. Springer LNCS 2002 (2001)","DOI":"10.1007\/3-540-45406-3_5"},{"key":"9002_CR88","doi-asserted-by":"crossref","unstructured":"Saraswat, V.: Concurrent constraint programming languages. PhD Thesis, Carnegie Mellon University, 1989. In ACM distinguished dissertation series. The MIT press (1993)","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"9002_CR89","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Rinard, M.: Concurrent constraint programming. In: Proc. of the 17th Annual Symposium on Principles of Programming Languages (POPL\u201990), pp. 232\u2013245. ACM Computer Society Press (1990)","DOI":"10.1145\/96709.96733"},{"key":"9002_CR90","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Rinard, M., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Proc. of the 18th Annual Symposium on Principles of Programming Languages (POPL\u201991), pp. 333\u2013352. ACM Computer Society Press (1991)","DOI":"10.1145\/99583.99627"},{"key":"9002_CR91","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: Domains for denotational semantics. In: Proc. ICALP\u201982, pp. 577\u2013613. Springer LNCS 140 (1982)","DOI":"10.1007\/BFb0012801"},{"key":"9002_CR92","unstructured":"SICStus Prolog user\u2019s manual, release 3.11.0, October 2003. Swedish Institute of Computer Science, Sweden. System available at http:\/\/www.sics.se\/isl\/sicstus."},{"key":"9002_CR93","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","volume":"214","author":"J.R. Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. J. ACM 21(4), 622\u2013642 (1974)","journal-title":"J. ACM"},{"key":"9002_CR94","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"Smolka, G., Treinen, R.: Records for logic programming. J. Logic Program. 18, 229\u2013258 (1994)","journal-title":"J. Logic Program."},{"key":"9002_CR95","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5, 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"9002_CR96","doi-asserted-by":"crossref","unstructured":"Tessier, A., Ferrand, G.: Declarative diagnosis in the CLP scheme. In: Deransart, P., Hermenegildo, M., Maiuszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming, Chapter 5, pp. 151\u2013174. Springer LNCS 1870 (2000)","DOI":"10.1007\/10722311_6"},{"key":"9002_CR97","doi-asserted-by":"crossref","unstructured":"del Vado V\u00edrseda, R.: A demand-driven narrowing calculus with overlapping definitional trees. In: Proc. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP\u201903), pp. 213\u2013227. ACM Press (2003)","DOI":"10.1145\/888251.888275"},{"key":"9002_CR98","doi-asserted-by":"crossref","unstructured":"del Vado V\u00edrseda, R.: Declarative constraint programming with definitional trees. In: Proc. 5th International Workshop on Frontiers of Combining Systems (FroCoS\u201905), pp. 184\u2013199. Springer LNAI 3717 (2005)","DOI":"10.1007\/11559306_10"},{"key":"9002_CR99","unstructured":"Van Hentenryck, P.: Constraint Satisfaction in Logic P\u201crogramming. Logic Programming Series, The MIT Press (1989)"},{"key":"9002_CR100","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1017\/S0269888900005798","volume":"63","author":"P. Van Hentenryck","year":"1991","unstructured":"Van Hentenryck, P.: Constraint logic programming. Knowl. Eng. Rev. 6(3), 151\u2013194 (1991)","journal-title":"Knowl. Eng. Rev."},{"key":"9002_CR101","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Van Hentenryck","year":"1994","unstructured":"Van Hentenryck, P., Simonis, H., Dincbas, M.: Constraint Satisfaction Using Constraint Logic Programming. Artif. Intell. 58, 113\u2013159 (1994)","journal-title":"Artif. Intell."},{"key":"9002_CR102","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. Van Hentenryck","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(FD). J. Logic Program. 37, 139\u2013164 (1998)","journal-title":"J. Logic Program."},{"key":"9002_CR103","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1017\/S1471068403001741","volume":"36","author":"P. Van Roy","year":"2003","unstructured":"Van Roy, P., Brand, P., Duchier, D., Haridi, S., Henz, M., Schulte, C.: Logic programming in the context of multiparadigm programming: the Oz experience. Theory Pract. Logic Program. 3(6), 717\u2013763 (2003)","journal-title":"Theory Pract. Logic Program."},{"key":"9002_CR104","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(85)90037-4","volume":"36","author":"G. Winskel","year":"1985","unstructured":"Winskel, G.: On powerdomains and modality. Theor. Comput. Sci. 36, 127\u2013137 (1985)","journal-title":"Theor. Comput. Sci."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9002-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9002-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9002-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T04:16:52Z","timestamp":1736828212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9002-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,24]]},"references-count":104,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2007,4,4]]}},"alternative-id":["9002"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9002-4","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"type":"print","value":"1388-3690"},{"type":"electronic","value":"1573-0557"}],"subject":[],"published":{"date-parts":[[2007,2,24]]}}}