{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:25:27Z","timestamp":1743081927337,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44716-4_13","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Complete Selection Function for Lazy Conditional Narrowing"],"prefix":"10.1007","author":[{"given":"Taro","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. Journal of the ACM, 47(4):776\u2013822, 2000.","journal-title":"Journal of the ACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and Nipkow. T. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"13_CR3","unstructured":"A. Bockmayr. Beitr\u00e4ge zur Theorie des Logisch-Funktionalen Programmierens. PhD thesis, Universit\u00e4t Karlsruhe, 1990. In German."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"13_CR5","unstructured":"M. Fay. First-order unification in equational theories. In Proceedings of the 4th Conference on Automated Deduction, pages 161\u2013167, 1979."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","volume":"67","author":"J. Gallier","year":"1989","unstructured":"J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science, 67:203\u2013260, 1989.","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-19129-1_7","volume-title":"Proceedings of the Workshop on Foundations of Logic and Functional Programming","author":"E. Giovannetti","year":"1986","unstructured":"E. Giovannetti and C. Moiso.A completeness result for E-unification algorithms based on conditional narrowing. In Proceedings of the Workshop on Foundations of Logic and Functional Programming, volume 306 of LNCS, pages 157\u2013167, 1986."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"J.C. Gonz\u00e1lez-Moreno, M.T. Hortal\u00e1-Gonz\u00e1lez, and M. Rodr\u00ecguez-Artalejo. A higer-order rewriting logic for functional logic programming. In Proceedings of the International Conference on Logic Programming, pages 153\u2013167. The MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0017"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"M. Hamada. Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables. In Proceedings of the 6th Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science, volume 31. Elsevier Science Publishers, 2000.","DOI":"10.1016\/S1571-0661(05)80332-9"},{"issue":"3","key":"13_CR10","first-page":"656","volume":"39","author":"M. Hamada","year":"1998","unstructured":"M. Hamada and T. Ida. Deterministic and non-deterministic lazy conditional narrowing and their implementations. Transactions of Information Processing Society of Japan, 39(3):656\u2013663, 1998.","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"13_CR11","unstructured":"M. Hamada and A. Middeldorp. Strong completeness of a lazy conditional narrowing calculus. In Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming, pages 14\u201332, Shonan Village, 1997. World Scientific."},{"key":"13_CR12","unstructured":"M. Hamada, A. Middeldorp, and T. Suzuki. Completeness results for a lazy conditional narrowing calculus. In Combinatorics, Computation and Logic: Proceedings of 2nd Discrete Mathematics and Theoretical Computer Science Conference and the 5th Australasian Theory Symposium, pages 217\u2013231, Auckland, 1999. Springer-Verlag Singapore."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19 & 20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19 & 20:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-57880-3_18","volume-title":"Proceedings of the 5th European Symposium on Programming","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. Lazy unification with simplification. In Proceedings of the 5th European Symposium on Programming, volume 788 of LNCS, pages 272\u2013286, 1994."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, volume 353 of LNAI. 1989.","DOI":"10.1007\/BFb0015791"},{"key":"13_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Proceedings of the 5th Conference on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot. Canonical forms and unification. In Proceedings of the 5th Conference on Automated Deduction, volume 87 of LNCS, pages 318\u2013334, 1980."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"key":"13_CR18","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, t D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"13_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/10705424_21","volume-title":"Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming","author":"M. Marin","year":"1999","unstructured":"M. Marin, T. Ida, and T. Suzuki. On reducing the search space of higer-order lazy narrowing. In Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming, volume 1722 of LNCS, pages 319\u2013334, 1999."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"A. Martelli, C. Moiso, and G.F. Rossi. Lazy unification algorithms for canonical rewrite systems. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Vol. II, Rewriting Techniques, pages 245\u2013274. Academic Press Press, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50014-6"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"A. Middeldorp and E. Hamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213\u2013253, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"6","key":"13_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1006\/jsco.1997.0197","volume":"25","author":"A. Middeldorp","year":"1998","unstructured":"A. Middeldorp and S. Okui. A deterministic lazy narrowing calculus. Journal of Symbolic Computation, 25(6):733\u2013757, 1998.","journal-title":"Journal of Symbolic Computation"},{"issue":"12","key":"13_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","volume":"167","author":"A. Middeldorp","year":"1996","unstructured":"A. Middeldorp, S. Okui, and T. Ida. Lazy narrowing: Strong completeness and eager variable elimination. Theoretical Computer Science, 167(1,2):95\u2013130, 1996.","journal-title":"Theoretical Computer Science"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. Progress in Theoretical Computer Science. Birk\u00e4user, 1998.","DOI":"10.1007\/978-1-4612-1778-7"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"W. Snyder. A Proof Theory for General Unification, volume 11 of Progress in Computer Science and Applied Logic. Birk\u00e4user, 1991.","DOI":"10.1007\/978-1-4612-0435-0_4"},{"key":"13_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-59200-8_56","volume-title":"Proceedings of the 6th International Conference on Rewriting Techniques and Applications","author":"T. Suzuki","year":"1995","unstructured":"T. Suzuki, A. Middeldorp, and T. Ida. Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 179\u2013193, Kaiserslautern, 1995. Springer-Verlag."},{"key":"13_CR27","unstructured":"A. Werner. Untersuchung von Strategien f\u00fcr das logisch-funktionale Programmieren. Shaker-Verlag Aachen, March 1998."}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:50:13Z","timestamp":1708170613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}