{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:37:57Z","timestamp":1725557877407},"publisher-location":"Berlin, Heidelberg","reference-count":75,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143083"},{"type":"electronic","value":"9783642143090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14309-0_13","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:09:58Z","timestamp":1277284198000},"page":"271-299","source":"Crossref","is-referenced-by-count":2,"title":["Transformation and Debugging of Functional Logic Programs"],"prefix":"10.1007","author":[{"given":"Maria","family":"Alpuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Demis","family":"Ballis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moreno","family":"Falaschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1013232219911","volume":"19","author":"Y. Ajiro","year":"2002","unstructured":"Ajiro, Y., Ueda, K.: Kima \u2014 an Automated Error Correction System for Concurrent Logic Programs. Automated Software Engineering\u00a019, 67\u201394 (2002)","journal-title":"Automated Software Engineering"},{"key":"13_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-48242-3_23","volume-title":"Logic Programming and Automated Reasoning","author":"E. Albert","year":"1999","unstructured":"Albert, E., Alpuente, M., Hanus, M., Vidal, G.: A Partial Evaluation Framework for Curry Programs. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol.\u00a01705, pp. 376\u2013395. Springer, Heidelberg (1999)"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1706356.1706367","volume-title":"Proc. 2010 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM)","author":"M. Alpuente","year":"2010","unstructured":"Alpuente, M., Baggi, M., Ballis, D., Falaschi, M.: A Fold\/Unfold Transformation Framework for Rewrite Theories and its Application to CCT. In: Proc. 2010 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM), pp. 43\u201352. ACM, New York (2010)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36575-3_5","volume-title":"Programming Languages and Systems","author":"M. Alpuente","year":"2003","unstructured":"Alpuente, M., Ballis, D., Correa, F.J., Falaschi, M.: Automated Correction of Functional Logic Programs. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 54\u201368. Springer, Heidelberg (2003)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45013-0_1","volume-title":"Logic Based Program Synthesis and Transformation","author":"M. Alpuente","year":"2003","unstructured":"Alpuente, M., Comini, M., Escobar, S., Falaschi, M., Lucas, S.: Abstract Diagnosis of Functional Programs. In: Leuschel, M., Bueno, F. (eds.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 1\u201316. Springer, Heidelberg (2003)"},{"key":"13_CR6","series-title":"ENTCS","volume-title":"Proc. Int\u2019l Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001","author":"M. Alpuente","year":"2001","unstructured":"Alpuente, M., Correa, F., Falaschi, M.: Declarative Debugging of Functional Logic Programs. In: Gramlich, B., Lucas, S. (eds.) Proc. Int\u2019l Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001. ENTCS, vol.\u00a057. Elsevier, Amsterdam (2001)"},{"key":"13_CR7","series-title":"ENTCS","volume-title":"Proc. 10th Int\u2019l Workshop on Functional and (Constraint) Logic Programming, WFLP 2001","author":"M. Alpuente","year":"2002","unstructured":"Alpuente, M., Correa, F., Falaschi, M.: A Debugging Scheme for Functional Logic Programs. In: Hanus, M. (ed.) Proc. 10th Int\u2019l Workshop on Functional and (Constraint) Logic Programming, WFLP 2001. ENTCS, vol.\u00a064. Elsevier, Amsterdam (2002)"},{"key":"13_CR8","series-title":"Sigplan Notices","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/258993.259015","volume-title":"Proc. ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997","author":"M. Alpuente","year":"1997","unstructured":"Alpuente, M., Falaschi, M., Juli\u00e1n, P., Vidal, G.: Specialization of Lazy Functional Logic Programs. In: Proc. ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997. Sigplan Notices, vol.\u00a032(12), pp. 151\u2013162. ACM Press, New York (1997)"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1093\/logcom\/13.2.287","volume":"13","author":"M. Alpuente","year":"2003","unstructured":"Alpuente, M., Falaschi, M., Juli\u00e1n, P., Vidal, G.: Uniform Lazy Narrowing. Journal of Logic and Computation\u00a013(2), 287\u2013312 (2003)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(94)00224-7","volume":"142","author":"M. Alpuente","year":"1995","unstructured":"Alpuente, M., Falaschi, M., Levi, G.: Incremental Constraint Satisfaction for Equational Logic Programming. Theoretical Computer Science\u00a0142(1), 27\u201357 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0743-1066(94)00024-Z","volume":"22","author":"M. Alpuente","year":"1995","unstructured":"Alpuente, M., Falaschi, M., Manzo, F.: Analyses of Unsatisfiability for Equational Logic Programming. Journal of Logic Programming\u00a022(3), 221\u2013252 (1995)","journal-title":"Journal of Logic Programming"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0026999","volume-title":"Algebraic and Logic Programming","author":"M. Alpuente","year":"1997","unstructured":"Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: Safe folding\/unfolding with conditional narrowing. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol.\u00a01298, pp. 1\u201315. Springer, Heidelberg (1997)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44411-4_17","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"M. Alpuente","year":"2000","unstructured":"Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: An Automatic Composition Algorithm for Functional Logic Programs. In: Jeffery, K., Hlav\u00e1\u010d, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol.\u00a01963, pp. 289\u2013297. Springer, Heidelberg (2000)"},{"issue":"1-3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.tcs.2003.10.033","volume":"311","author":"M. Alpuente","year":"2004","unstructured":"Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: Rules + Strategies for Transforming Lazy Functional Logic Programs. Theoretical Computer Science\u00a0311(1-3), 479\u2013525 (2004)","journal-title":"Theoretical Computer Science"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-61055-3_28","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"M. Alpuente","year":"1996","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Narrowing-driven Partial Evaluation of Functional Logic Programs. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 45\u201361. Springer, Heidelberg (1996)"},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems\u00a020(4), 768\u2013844 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys\u00a030(3es), 9es (1998)","DOI":"10.1145\/289121.289130"},{"issue":"3","key":"13_CR18","first-page":"273","volume":"5","author":"M. Alpuente","year":"2005","unstructured":"Alpuente, M., Hanus, M., Lucas, S., Vidal, G.: Specialization of functional logic programs based on needed narrowing. TPLP\u00a05(3), 273\u2013303 (2005)","journal-title":"TPLP"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jsc.2004.12.007","volume":"40","author":"S. Antoy","year":"2005","unstructured":"Antoy, S.: Evaluation strategies for functional logic programming. J. Symb. Comput.\u00a040(1), 875\u2013903 (2005)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A Needed Narrowing Strategy. Journal of the ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting using Dependency Pairs. TCS\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"TCS"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"M. Bellia","year":"1986","unstructured":"Bellia, M., Levi, G.: The relation between logic and functional languages. Journal of Logic Programming\u00a03, 217\u2013236 (1986)","journal-title":"Journal of Logic Programming"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BFb0014425","volume-title":"Recent Trends in Data Type Specification","author":"D. Bert","year":"1995","unstructured":"Bert, D., Echahed, R.: On the Operational Semantics of the Algebraic and Logic Programming Language LPG. In: Reggio, G., Astesiano, E., Tarlecki, A. (eds.) Abstract Data Types 1994 and COMPASS 1994. LNCS, vol.\u00a0906, pp. 132\u2013152. Springer, Heidelberg (1995)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0743-1066(99)00017-5","volume":"40","author":"H. Bostrom","year":"1999","unstructured":"Bostrom, H., Idestam-Alquist, P.: Induction of Logic Programs by Example\u2013guided Unfolding. Journal of Logic Programming\u00a040, 159\u2013183 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A Transformation System for Developing Recursive Programs. Journal of the ACM\u00a024(1), 44\u201367 (1977)","journal-title":"Journal of the ACM"},{"key":"13_CR26","series-title":"ENTCS","volume-title":"Proc. 3rd Int\u2019l Workshop on Security and Rewriting Techniques, SecreT 2008","author":"A. Santana de Oliveira","year":"2008","unstructured":"Santana de Oliveira, A., Kirchner, C., Kirchner, H.: Analysis of Rewrite-Based Access Control Policies. In: Proc. 3rd Int\u2019l Workshop on Security and Rewriting Techniques, SecreT 2008. ENTCS. Elsevier, Amsterdam (2008)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-78969-7_22","volume-title":"Functional and Logic Programming","author":"R. Caballero","year":"2008","unstructured":"Caballero, R., Rodr\u00edguez Artalejo, M., del Vado V\u00edrseda, R.: Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 305\u2013321. Springer, Heidelberg (2008)"},{"key":"13_CR28","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-Rold\u00e1n","year":"2001","unstructured":"Caballero-Rold\u00e1n, R., L\u00f3pez-Fraguas, F.J., Rodr\u00edquez 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":"13_CR29","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. Springer, New York (2007)"},{"issue":"1-3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0743-1066(98)10033-X","volume":"39","author":"M. Comini","year":"1999","unstructured":"Comini, M., Levi, G., Meo, M.C., Vitiello, G.: Abstract diagnosis. Journal of Logic Programming\u00a039(1-3), 43\u201393 (1999)","journal-title":"Journal of Logic Programming"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. Fourth ACM Symp. on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0026098","volume-title":"CAAP \u201988","author":"R. Echahed","year":"1988","unstructured":"Echahed, R.: On completeness of narrowing strategies. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol.\u00a0299, pp. 89\u2013101. Springer, Heidelberg (1988)"},{"issue":"1-2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S. Escobar","year":"2006","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: A Rewriting-Based Inference System for the NRL Protocol Analyzer and its Meta-Logical Properties. TCS\u00a0367(1-2), 162\u2013202 (2006)","journal-title":"TCS"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-73449-9_13","volume-title":"Term Rewriting and Applications","author":"S. Escobar","year":"2007","unstructured":"Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 153\u2013168. Springer, Heidelberg (2007)"},{"key":"13_CR35","volume-title":"Proc. 12th Int\u2019l Conf. on Logic Programming","author":"S. Etalle","year":"1995","unstructured":"Etalle, S., Gabbrielli, M.: Modular Transformations of CLP Programs. In: Sterling, L. (ed.) Proc. 12th Int\u2019l Conf. on Logic Programming. The MIT Press, Cambridge (1995)"},{"key":"13_CR36","first-page":"993","volume-title":"Proc. Fifth Int\u2019l Conf. on Logic Programming","author":"M. Falaschi","year":"1988","unstructured":"Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: A new Declarative Semantics for Logic Languages. In: Kowalski, R., Bowen, K. (eds.) Proc. Fifth Int\u2019l Conf. on Logic Programming, pp. 993\u20131005. The MIT Press, Cambridge (1988)"},{"key":"13_CR37","unstructured":"Fay, M.: First Order Unification in an Equational Theory. In: Proc. of 4th Int\u2019l Conf. on Automated Deduction, CADE 1979, pp. 161\u2013167 (1979)"},{"issue":"3","key":"13_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0743-1066(87)90001-X","volume":"4","author":"G. Ferrand","year":"1987","unstructured":"Ferrand, G.: Error Diagnosis in Logic Programming, and Adaptation of E.Y.Shapiro\u2019s Method. Journal of Logic Programming\u00a04(3), 177\u2013198 (1987)","journal-title":"Journal of Logic Programming"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-44716-4_15","volume-title":"Functional and Logic Programming","author":"C. Ferri","year":"2001","unstructured":"Ferri, C., Hern\u00e1ndez, J., Ram\u00edrez, M.J.: Incremental Learning of Functional Logic Programs. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol.\u00a02024, pp. 233\u2013247. Springer, Heidelberg (2001)"},{"key":"13_CR40","first-page":"172","volume-title":"Proc. Second IEEE Int\u2019l Symp. on Logic Programming","author":"L. Fribourg","year":"1985","unstructured":"Fribourg, L.: SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In: Proc. Second IEEE Int\u2019l Symp. on Logic Programming, pp. 172\u2013185. IEEE, New York (1985)"},{"key":"13_CR41","doi-asserted-by":"publisher","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. Journal of Logic Programming\u00a019&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"13_CR42","first-page":"80","volume-title":"Proc. 24th ACM Symp. on Principles of Programming Languages","author":"M. Hanus","year":"1997","unstructured":"Hanus, M.: A unified computation model for functional and logic programming. In: Proc. 24th ACM Symp. on Principles of Programming Languages, Paris, pp. 80\u201393. ACM, New York (1997)"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-74610-2_5","volume-title":"Logic Programming","author":"M. Hanus","year":"2007","unstructured":"Hanus, M.: Multi-paradigm Declarative Languages (invited tutorial). In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 45\u201375. Springer, Heidelberg (2007)"},{"key":"13_CR44","unstructured":"Hanus, M., Kuchen, H., Moreno-Navarro, J.J.: Curry: A Truly Functional Logic Language. In: Proc. ILPS 1995 Workshop on Visions for the Future of Logic Programming, pp. 95\u2013107 (1995)"},{"issue":"1","key":"13_CR45","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":"13_CR46","unstructured":"Hanus, M. (ed.): Curry: An Integrated Functional Logic Language (ver. 0.8.2) (2006), http:\/\/www.informatik.uni-kiel.de\/~curry"},{"key":"13_CR47","series-title":"LNAI","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015791","volume-title":"Foundations of Equational Logic Programming","author":"S. H\u00f6lldobler","year":"1989","unstructured":"H\u00f6lldobler, S.: Foundations of Equational Logic Programming. LNCS (LNAI), vol.\u00a0353. Springer, Heidelberg (1989)"},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction","author":"J.M. Hullot","year":"1980","unstructured":"Hullot, J.M.: Canonical Forms and Unification. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/3-540-15984-3_328","volume-title":"EUROCAL \u201985. European Conference on Computer Algebra. Linz, Austria, April 1-3, 1985. Proceedings","author":"H. Hussman","year":"1985","unstructured":"Hussman, H.: Unification in Conditional-Equational Theories. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol.\u00a0204, pp. 543\u2013553. Springer, Heidelberg (1985)"},{"key":"13_CR50","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"13_CR51","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a0I, pp. 1\u2013112. Oxford University Press, Oxford (1992)"},{"key":"13_CR52","first-page":"319","volume-title":"Proc. the Joint Int\u2019l Conf. and Symp. on Logic Programming, JICSLP 1996","author":"M. Leuschel","year":"1996","unstructured":"Leuschel, M., De Schreye, D., de Waal, A.: A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. In: Maher, M. (ed.) Proc. the Joint Int\u2019l Conf. and Symp. on Logic Programming, JICSLP 1996, pp. 319\u2013332. The MIT Press, Cambridge (1996)"},{"key":"13_CR53","first-page":"318","volume-title":"Proc. Second IEEE Symp. on Logic In Computer Science","author":"G. Levi","year":"1987","unstructured":"Levi, G., Palamidessi, C., Bosco, P.G., Giovannetti, E., Moiso, C.: A complete semantics caracterization of K-LEAF, a logic language with partial functions. In: Proc. Second IEEE Symp. on Logic In Computer Science, pp. 318\u2013327. IEEE, New York (1987)"},{"key":"13_CR54","unstructured":"Lloyd, J.W.: Debugging for a declarative programming language. Machine Intelligence\u00a015 (1998)"},{"key":"13_CR55","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"Lloyd, J.W., Shepherdson, J.C.: Partial Evaluation in Logic Programming. Journal of Logic Programming\u00a011, 217\u2013242 (1991)","journal-title":"Journal of Logic Programming"},{"key":"13_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"F.J. L\u00f3pez-Fraguas","year":"1999","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez Hern\u00e1ndez, J.: Toy: A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 244\u2013247. Springer, Heidelberg (1999)"},{"key":"13_CR57","first-page":"197","volume-title":"Proc. 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2007)","author":"F.J. L\u00f3pez-Fraguas","year":"2007","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A simple rwwrite notion for call-time choice semantics. In: Proc. 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2007), pp. 197\u2013208. ACM, New York (2007)"},{"key":"13_CR58","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1480945.1480959","volume-title":"Proc. 2009 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM)","author":"F.J. L\u00f3pez-Fraguas","year":"2009","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A flexible framework for programming with non-deterministicfunctions. In: Proc. 2009 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM), pp. 91\u2013100. ACM, New York (2009)"},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-00675-3_14","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"F.J. L\u00f3pez-Fraguas","year":"2009","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: Narrowing for first order functional logic programs with call-time choice semantics. In: Seipel, D., Hanus, M., Wolf, A. (eds.) INAP 2007. LNCS, vol.\u00a05437, pp. 206\u2013222. Springer, Heidelberg (2009)"},{"key":"13_CR60","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1291201.1291204","volume-title":"Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007","author":"S. Marlow","year":"2007","unstructured":"Marlow, S., Iborra, J., Pope, B., Gill, A.: A Lightweight Interactive Debugger for Haskell. In: Keller, G. (ed.) Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007, Freiburg, Germany, September 30, pp. 13\u201324. ACM, New York (2007)"},{"key":"13_CR61","first-page":"597","volume-title":"Proc. ICLP 1995","author":"B. Martens","year":"1995","unstructured":"Martens, B., Gallagher, J.: Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. In: Sterling, L. (ed.) Proc. ICLP 1995, pp. 597\u2013611. MIT Press, Cambridge (1995)"},{"issue":"1-2","key":"13_CR62","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J. Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation\u00a020(1-2), 123\u2013160 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"3","key":"13_CR63","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"Moreno-Navarro, J.J., Rodr\u00edguez-Artalejo, M.: Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming\u00a012(3), 191\u2013224 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"13_CR64","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"S. Muggleton","year":"1991","unstructured":"Muggleton, S.: Inductive Logic Programming. New Generation Computing\u00a08(3), 295\u2013318 (1991)","journal-title":"New Generation Computing"},{"key":"13_CR65","doi-asserted-by":"crossref","unstructured":"Naish, L.: A declarative debugging scheme. Journal of Functional and Logic Programming\u00a01997(3) (April 1997)","DOI":"10.7551\/mitpress\/4299.001.0001"},{"key":"13_CR66","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73824-1","volume-title":"Computing in Horn Clause Theories","author":"P. Padawitz","year":"1988","unstructured":"Padawitz, P.: Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol.\u00a016. Springer, Berlin (1988)"},{"key":"13_CR67","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19,20","author":"A. Pettorossi","year":"1994","unstructured":"Pettorossi, A., Proietti, M.: Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming\u00a019,20, 261\u2013320 (1994)","journal-title":"Journal of Logic Programming"},{"key":"13_CR68","first-page":"138","volume-title":"Proc. Second IEEE Int\u2019l Symp. on Logic Programming","author":"U.S. Reddy","year":"1985","unstructured":"Reddy, U.S.: Narrowing as the Operational Semantics of Functional Languages. In: Proc. Second IEEE Int\u2019l Symp. on Logic Programming, pp. 138\u2013151. IEEE, New York (1985)"},{"key":"13_CR69","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/1706356.1706373","volume-title":"Proc. 2010 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM)","author":"A. Riesco","year":"2010","unstructured":"Riesco, A., Rodr\u00edguez-Hortal\u00e1, J.: Programming with Singular and Plural Non-deterministic Functions. In: Proc. 2010 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-based Program Manipulation (PEPM), pp. 83\u201392. ACM, New York (2010)"},{"key":"13_CR70","volume-title":"Algorithmic Program Debugging","author":"E.Y. Shaphiro","year":"1982","unstructured":"Shaphiro, E.Y.: Algorithmic Program Debugging. The MIT Press, Cambridge (1982)"},{"issue":"6","key":"13_CR71","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M.H. S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A Positive Supercompiler. Journal of Functional Programming\u00a06(6), 811\u2013838 (1996)","journal-title":"Journal of Functional Programming"},{"key":"13_CR72","unstructured":"Tamaki, H., Sato, T.: Unfold\/Fold Transformations of Logic Programs. In: T\u00e4rnlund, S. (ed.) Proc. Second Int\u2019l Conf. on Logic Programming, Uppsala, Sweden, pp. 127\u2013139 (1984)"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"13_CR73","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"13_CR74","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V.F. Turchin","year":"1986","unstructured":"Turchin, V.F.: The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems\u00a08(3), 292\u2013325 (1986)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR75","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P.L. Wadler","year":"1990","unstructured":"Wadler, P.L.: Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science\u00a073, 231\u2013248 (1990)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","A 25-Year Perspective on Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14309-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T14:33:51Z","timestamp":1685630031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14309-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143083","9783642143090"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14309-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}