{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:39:19Z","timestamp":1725485959386},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414285"},{"type":"electronic","value":"9783540444640"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","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":[[2000]]},"DOI":"10.1007\/3-540-44464-5_17","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T19:34:00Z","timestamp":1181158440000},"page":"237-254","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Functional Logic Programs by Difference-Lists"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Ferri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,8]]},"reference":[{"unstructured":"E. Albert, C. Ferri, F. Steiner, and G. Vidal. List-Processing Optimizations in a Multi-Paradigm Declarative Language. Technical Report DSIC, UPV, 2000. Available from URL: \n                  http:\/\/www.dsic.upv.es\/users\/elp\/papers.html\n                  \n                .","key":"17_CR1"},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/10705424_10","volume-title":"A Transformation System for Lazy Functional Logic Programs","author":"M. Alpuente","year":"1999","unstructured":"M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. A Transformation System for Lazy Functional Logic Programs. In A. Middeldorp and T. Sato, editors, Proc. of FLOPS\u201999, pages 147\u2013162. Springer LNCS 1722, 1999."},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Definitional trees","author":"S. Antoy","year":"1992","unstructured":"S. Antoy. Definitional trees. In Proc. of the 3rd Int\u2019l Conference on Algebraic and Logic Programming, ALP\u201992, pages 143\u2013157. Springer LNCS 632, 1992."},{"issue":"4","key":"17_CR4","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":"17_CR5","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243\u2013320. Elsevier, Amsterdam, 1990."},{"doi-asserted-by":"crossref","unstructured":"A. J. Gill, J. Launchbury, and S. L. Peyton Jones. A Short Cut to Deforestation. In Proc. of FPLCA\u201993, pages 223\u2013232, New York, NY (USA), 1993. ACM Press.","key":"17_CR6","DOI":"10.1145\/165180.165214"},{"key":"17_CR7","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"},{"unstructured":"M. Hanus, S. Antoy, J. Koj, P. Niederau, R. Sadre, and F. Steiner. PAKCS 1.2: User Manual. Technical report, CAU Kiel, 2000. Available at \n                  http:\/\/www.informatik.uni-kiel.de\/~pakcs\n                  \n                .","key":"17_CR8"},{"unstructured":"M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at \n                  http:\/\/www.informatik.uni-kiel.de\/~curry\n                  \n                , 2000.","key":"17_CR9"},{"unstructured":"G. Huet and J. J. L\u00e9vy. Computations in orthogonal rewriting systems, Part I + II. In J. L. Lassez and G. D. Plotkin, editors, Computational Logic \u2014 Essays in Honor of Alan Robinson, pages 395\u2013443, 1992.","key":"17_CR10"},{"key":"17_CR11","series-title":"Tech. Report PMG","volume-title":"A Novel representation of Lists and its Application to the Function reverse","author":"J. Hughes","year":"1984","unstructured":"J. Hughes. A Novel representation of Lists and its Application to the Function reverse. Tech. Report PMG-38, Chalmers Institute of Technology, Sweden, 1984."},{"doi-asserted-by":"crossref","unstructured":"K. Marriott and H. S\u00f8ndergaard. Difference-list Transformation for Prolog. New Generation Computing, 11(2):125\u2013157, October 1993.","key":"17_CR12","DOI":"10.1007\/BF03037156"},{"unstructured":"L. Sterling and E. Shapiro. The Art of Prolog: Advanced Programming Techniques. MIT Press, 1986.","key":"17_CR13"},{"unstructured":"H. Tamaki and T. Sato. Unfold\/Fold Transformations of Logic Programs. In Proc. of Second Int\u2019l Conf. on Logic Programming, pages 127\u2013139, 1984.","key":"17_CR14"},{"key":"17_CR15","series-title":"Technical report","volume-title":"The Concatenate Vanishes","author":"P. L. Wadler","year":"1987","unstructured":"P. L. Wadler. The Concatenate Vanishes. Technical report, Department of Computing Science, University of Glasgow, UK, 1987."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. L. Wadler","year":"1990","unstructured":"P. L. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231\u2013248, 1990.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44464-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:46:26Z","timestamp":1558259186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44464-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414285","9783540444640"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44464-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"8 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}