{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:04:53Z","timestamp":1765667093897},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546235"},{"type":"electronic","value":"9783642546242"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54624-2_16","type":"book-chapter","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T22:42:59Z","timestamp":1393627379000},"page":"315-336","source":"Crossref","is-referenced-by-count":5,"title":["Functional Logic Programming in Maude"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Escobar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Ballis, D., Falaschi, M.: Transformation and debugging of functional logic programs. In: Dovier, A., Pontelli, E. (eds.) 25 Years of Logic Programming. LNCS, vol.\u00a06125, pp. 271\u2013299. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14309-0_13"},{"key":"16_CR2","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. Journal of Symbolic Computation\u00a040, 875\u2013903 (2005)","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"16_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.jsc.2010.01.006","volume":"45","author":"S. Antoy","year":"2010","unstructured":"Antoy, S.: Programming with narrowing: A tutorial. Journal of Symbolic Compututation\u00a045(5), 501\u2013522 (2010)","journal-title":"Journal of Symbolic Compututation"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Antoy, S., Echahed, R., Hanus, M.: Parallel evaluation strategies for functional logic languages. In: Naish, L. (ed.) ICLP, pp. 138\u2013152. MIT Press (1997)","DOI":"10.7551\/mitpress\/4299.003.0016"},{"issue":"4","key":"16_CR5","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. J. ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S. Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Commun. ACM\u00a053(4), 74\u201385 (2010)","journal-title":"Commun. ACM"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-60939-3_17","volume-title":"Logic Program Synthesis and Transformation","author":"T. Arts","year":"1996","unstructured":"Arts, T., Zantema, H.: Termination of logic programs using semantic unification. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 219\u2013233. Springer, Heidelberg (1996)"},{"key":"16_CR8","unstructured":"Bae, K., Escobar, S., Meseguer, J.: Abstract logical model checking of infinite-state systems using narrowing. In: van Raamsdonk, F. (ed.) RTA. LIPIcs, vol.\u00a021, pp. 81\u201396. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-02348-4_27","volume-title":"Rewriting Techniques and Applications","author":"M. Clavel","year":"2009","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Escobar, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: Unification and narrowing in maude 2.4. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 380\u2013390. Springer, Heidelberg (2009)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","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. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"16_CR11","first-page":"3","volume-title":"International Logic Programming Symposium","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: Goal Solving as Operational Semantics. In: International Logic Programming Symposium, Portland, OR, pp. 3\u201317. MIT Press, Cambridge (1995)"},{"key":"16_CR12","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Meseguer, J., Talcott, C.L.: Variants, unification, narrowing, and symbolic reachability in maude 2.6. In: Schmidt-Schau\u00df, M. (ed.) RTA. LIPIcs, vol.\u00a010, pp. 31\u201340. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"issue":"7-8","key":"16_CR13","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F. Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the church-rosser and coherence properties of conditional order-sorted rewrite theories. J. Log. Algebr. Program.\u00a081(7-8), 816\u2013850 (2012)","journal-title":"J. Log. Algebr. Program."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11841883_8","volume-title":"Graph Transformations","author":"R. Echahed","year":"2006","unstructured":"Echahed, R., Peltier, N.: Narrowing data-structures with pointers. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 92\u2013106. Springer, Heidelberg (2006)"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/888251.888263","volume-title":"PPDP","author":"S. Escobar","year":"2003","unstructured":"Escobar, S.: Refining weakly outermost-needed rewriting and narrowing. In: PPDP, pp. 113\u2013123. ACM Press, New York (2003)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24754-8_12","volume-title":"Functional and Logic Programming","author":"S. Escobar","year":"2004","unstructured":"Escobar, S.: Implementing natural rewriting and narrowing efficiently. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 147\u2013162. Springer, Heidelberg (2004)"},{"key":"16_CR17","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":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-32033-3_21","volume-title":"Term Rewriting and Applications","author":"S. Escobar","year":"2005","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Natural narrowing for general term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 279\u2013293. Springer, Heidelberg (2005)"},{"issue":"7-8","key":"16_CR19","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S. Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. Journal of Logic and Algebraic Programming\u00a081(7-8), 898\u2013928 (2012)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"16_CR20","unstructured":"Fay, M.: First-order unification in an equational theory. In: Joyner, W.H. (ed.) Proceedings of the 4th Workshop on Automated Deduction, Austin, Texas, USA, pp. 161\u2013167. Academic Press (1979)"},{"key":"16_CR21","unstructured":"Goguen, J., Meseguer, J.: Eqlog: Equality, Types and Generic Modules for Logic Programming. In: de Groot, D., Lindstrom, G. (eds.) Logic Programming, Functions, Relations and Equations, pp. 295\u2013363. Prentice-Hall (1986)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"1","author":"J.A. Goguen","year":"1984","unstructured":"Goguen, J.A., Meseguer, J.: Equality, types, modules, and (why not?) generics for logic programming. J. Log. Program.\u00a01(2), 179\u2013210 (1984)","journal-title":"J. Log. Program."},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"TAPSOFT \u201987 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987.","author":"J.A. Goguen","year":"1987","unstructured":"Goguen, J.A., Meseguer, J.: Models and equality for logical programming. In: Ehrig, H., Levi, G., Montanari, U. (eds.) TAPSOFT 1987 and CFLP 1987. LNCS, vol.\u00a0250, pp. 1\u201322. Springer, Heidelberg (1987)"},{"key":"16_CR24","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":"16_CR25","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. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 45\u201375. Springer, Heidelberg (2007)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-37651-1_6","volume-title":"Programming Logics","author":"M. Hanus","year":"2013","unstructured":"Hanus, M.: Functional logic programming: From theory to curry. In: Voronkov, A., Weidenbach, C. (eds.) Ganzinger Festschrif. LNCS, vol.\u00a07797, pp. 123\u2013168. Springer, Heidelberg (2013)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, vol.\u00a0353. Springer, Heidelberg (1989)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Bibel, W., Kowalski, R.A. (eds.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)","DOI":"10.1007\/3-540-10009-1_25"},{"issue":"4","key":"16_CR29","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM J. Comput.\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM J. Comput."},{"key":"16_CR30","unstructured":"Lloyd, J.W.: Programming in an integrated functional and logic language. Journal of Functional and Logic Programming\u00a01999(3) (1999)"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems\u00a04, 258\u2013282 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"16_CR32","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. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BFb0013826","volume-title":"Algebraic and Logic Programming","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 158\u2013200. Springer, Heidelberg (1992)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"16_CR35","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":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C.G. Moreno","year":"1999","unstructured":"Moreno, J.C.G., 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. Log. Program.\u00a040(1), 47\u201387 (1999)","journal-title":"J. Log. Program."},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 371\u2013443. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"16_CR38","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S1571-0661(04)80210-X","volume":"51","author":"D. Plump","year":"2001","unstructured":"Plump, D.: Essentials of term graph rewriting. Electr. Notes Theor. Comput. Sci.\u00a051, 277\u2013289 (2001)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"16_CR39","unstructured":"Reddy, U.S.: Narrowing as the Operational Semantics of Functional Languages. In: Proceedings of Second IEEE Int\u2019l Symp. on Logic Programming, pp. 138\u2013151. IEEE Computer Society Press (1985)"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Riesco, A., Rodr\u00edguez-Hortal\u00e1, J.: Singular and plural functions for functional logic programming. CoRR, abs\/1203.2431 (2012)","DOI":"10.1017\/S147106841200004X"},{"issue":"4","key":"16_CR41","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers commutativity, and associativity. J. ACM\u00a021(4), 622\u2013642 (1974)","journal-title":"J. ACM"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"16_CR42","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"16_CR43","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/FI-1998-33105","volume":"33","author":"L. Vigneron","year":"1998","unstructured":"Vigneron, L.: Automated deduction techniques for studying rough algebras. Fundamenta Informaticae\u00a033(1), 85\u2013103 (1998)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Specification, Algebra, and Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54624-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T18:09:43Z","timestamp":1716574183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54624-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546235","9783642546242"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54624-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}