{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:00Z","timestamp":1725550080147},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119989"},{"type":"electronic","value":"9783642119996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11999-6_11","type":"book-chapter","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T00:52:29Z","timestamp":1268700749000},"page":"162-178","source":"Crossref","is-referenced-by-count":1,"title":["A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions"],"prefix":"10.1007","author":[{"given":"Rafael","family":"del Vado V\u00edrseda","sequence":"first","affiliation":[]},{"given":"Ignacio","family":"Casti\u00f1eiras","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44716-4_11","volume-title":"Functional and Logic Programming","author":"R. Caballero","year":"2001","unstructured":"Caballero, R., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: Theoretical Foundations for the Declarative Debugging of Lazy Functional-Logic Programs. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol.\u00a02024, pp. 170\u2013184. Springer, Heidelberg (2001)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-24754-8_7","volume-title":"Functional and Logic Programming","author":"R. Caballero","year":"2004","unstructured":"Caballero, R., Rodr\u00edguez-Artalejo, M.: $\\mathcal{DDT}$ : A Declarative Debugging Tool for Functional-Logic Languages. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 70\u201384. Springer, Heidelberg (2004)"},{"issue":"1\/2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10990-007-9002-4","volume":"20","author":"F.J. L\u00f3pez-Fraguas","year":"2007","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M., del Vado-V\u00edrseda, R.: A New Generic Scheme for Functional-Logic Programming with Constraints. Journal of Higher-Order and Symbolic Computation\u00a020(1\/2), 73\u2013122 (2007)","journal-title":"Journal of Higher-Order and Symbolic Computation"},{"key":"11_CR4","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. ICLP 1997, pp. 153\u2013167 (1997)","DOI":"10.7551\/mitpress\/4299.003.0017"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","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. Journal of Logic Programming\u00a040, 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"key":"11_CR6","unstructured":"Hanus, M.: Curry: an Integrated Functional Logic Language., http:\/\/www-i2.informatik.uni-kiel.de\/~curry\/"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"Hanus, M., Prehofer, C.: Higher-order narrowing with definitional trees. Journal of Functional Programming\u00a09(1), 33\u201375 (1999)","journal-title":"Journal of Functional Programming"},{"key":"11_CR8","volume-title":"Introduction to Combinatorics and \u03bb-Calculus","author":"J.R. Hindley","year":"1986","unstructured":"Hindley, J.R., Seldin, J.P.: Introduction to Combinatorics and \u03bb-Calculus. Cambridge University Press, Cambridge (1986)"},{"key":"11_CR9","unstructured":"Lloyd, J.W.: Combining functional and logic programming languages. In: Proc. ILPS 1994 (1994)"},{"key":"11_CR10","unstructured":"Lock, H.C.: The Implementation of Functional-Logic Languages. Oldenbourg Verlag (1993)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: $\\mathcal{TOY}$ : A Multiparadigm Declarative System. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 244\u2013247. Springer, Heidelberg (1999), http:\/\/toy.sourceforge.net","DOI":"10.1007\/3-540-48685-2_19"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030541","volume-title":"Isabelle: A Generic Theorem Prover","author":"L.C. Paulson","year":"1994","unstructured":"Paulson, L.C.: Isabelle: A Generic Theorem Prover. LNCS, vol.\u00a0828. Springer, Heidelberg (1994)"},{"key":"11_CR13","doi-asserted-by":"publisher","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. TCS\u00a096, 73\u2013155 (1992)","journal-title":"TCS"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with \u03bb-abstraction, function variables, and simple unification. Journal of Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0026816","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"K. Nakahara","year":"1995","unstructured":"Nakahara, K., Middeldorp, A., Ida, T.: A complete narrowing calculus for higher-order functional-logic programming. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol.\u00a0982, pp. 97\u2013114. Springer, Heidelberg (1995)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Naish, L.: A Declarative Debugging Scheme. Journal of Functional and Logic Programming (1997)","DOI":"10.7551\/mitpress\/4299.001.0001"},{"key":"11_CR17","unstructured":"Smolka, G.: The Definition of Kernel Oz. Technical Report DFKI Research Report RR-94-23, Saarbr\u00fccken, Germany (1994)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/888251.888275","volume-title":"Proc. PPDP 2003","author":"R. Vado-V\u00edrseda del","year":"2003","unstructured":"del Vado-V\u00edrseda, R.: A Demand-driven Narrowing Calculus with Overlapping Definitional Trees. In: Proc. PPDP 2003, pp. 253\u2013263. ACM, New York (2003)"},{"key":"11_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11559306_10","volume-title":"Frontiers of Combining Systems","author":"R. Vado V\u00edrseda del","year":"2005","unstructured":"del Vado V\u00edrseda, R.: Declarative Constraint Programming with Definitional Trees. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 184\u2013199. Springer, Heidelberg (2005)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-75292-9_12","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"R. Vado V\u00edrseda del","year":"2007","unstructured":"del Vado V\u00edrseda, R.: A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol.\u00a04711, pp. 169\u2013184. Springer, Heidelberg (2007)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1599410.1599418","volume-title":"Proc. PPDP 2009","author":"R. Vado-V\u00edrseda del","year":"2009","unstructured":"del Vado-V\u00edrseda, R.: A Higher-Order Logical Framework for the Algorithmic Debugging and Verification of Declarative Programs. In: Proc. PPDP 2009, pp. 49\u201360. ACM Press, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11999-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T23:37:21Z","timestamp":1711323441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11999-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119989","9783642119996"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11999-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}