{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:36Z","timestamp":1751983656042},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44404-1_24","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:20:51Z","timestamp":1194981651000},"page":"381-398","source":"Crossref","is-referenced-by-count":8,"title":["Using an Abstract Representation to Specialize Functional Logic Programs"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hanus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"E. Albert, M. Alpuente, M. Falaschi, and G. Vidal. Indy User\u2019s Manual. Technical report, UPV, 1998. Available from URL: http:\/\/www.dsic.upv.es\/users\/elp\/papers.html. 396, 396"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"E. Albert, M. Alpuente, M. Hanus, and G. Vidal. A Partial Evaluation Framework for Curry Programs. In Proc. of the 6th Int'l Conf. on Logic for Programming and Automated Reasoning, LPAR\u201999, pages 376\u2013395. Springer LNAI 1705, 1999. 382, 382, 383, 390, 390, 390, 390","DOI":"10.1007\/3-540-48242-3_23"},{"key":"24_CR3","unstructured":"E. Albert, M. Hanus, and G. Vidal. Using an Abstract Representation to Specialize Functional Logic Programs. Technical report, UPV, 2000. Available from URL: http:\/\/www.dsic.upv.es\/users\/elp\/papers.html. 383, 386, 392, 396, 396"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems, 20(4):768\u2013844, 1998. 381, 381, 382, 382, 382, 383, 384, 392, 393, 396, 396","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR5","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'l Conference on Algebraic and Logic Programming, ALP\u201992, pages 143\u2013157. Springer LNCS 632, 1992. 382"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. Journal of the ACM, 2000 (to appear). Previous version in Proc. of POPL\u201994, pages 268\u2013279. 382","DOI":"10.1145\/347476.347484"},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-50940-2_29","volume-title":"A Self-Applicable Partial Evaluator for Term Rewriting Systems","author":"A. Bondorf","year":"1989","unstructured":"A. Bondorf. A Self-Applicable Partial Evaluator for Term Rewriting Systems. In Proc. of TAPSOFT\u201989, pages 81\u201395. Springer LNCS 352, 1989. 382"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe, D. De Schreye, and B. Martens. A General Criterion for Avoiding Infinite Unfolding. New Generation Computing, 11(1):47\u201379, 1992. 392","journal-title":"New Generation Computing"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"C. Consel and O. Danvy. Tutorial notes on Partial Evaluation. In Proc. ACM Symp. on Principles of Programming Languages, pages 493\u2013501, 1993. 381","DOI":"10.1145\/158511.158707"},{"issue":"2&3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"D. De Schreye, R. Gl\u00fcck, J. J\u00f8rgensen, M. Leuschel, B. Martens, and M. H. S\u00f8rensen. Conjunctive Partial Deduction: Foundations, Control, Algorihtms, and Experiments. Journal of Logic Programming, 41(2&3):231\u2013277, 1999. 382","journal-title":"Journal of Logic Programming"},{"key":"24_CR11","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: Formal Models and Semantics, pages 243\u2013320. Elsevier, Amsterdam, 1990. 383","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, pages 88\u201398. ACM, New York, 1993. 381, 391, 392","DOI":"10.1145\/154630.154640"},{"key":"24_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Partial Evaluation. Int'l Dagstuhl Seminar","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck and M. H. S\u00f8rensen. A Roadmap to Metacomputation by Supercompilation. In Partial Evaluation. Int'l Dagstuhl Seminar, pages 137\u2013160. Springer LNCS 1110, 1996. 382"},{"key":"24_CR14","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. 382, 383","journal-title":"Journal of Logic Programming"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"M. Hanus. A unified computation model for functional and logic programming. In Proc. of POPL\u201997, pages 80\u201393. ACM, New York, 1997. 382, 385","DOI":"10.1145\/263699.263710"},{"key":"24_CR16","series-title":"Lect Notes Comput Sci","first-page":"376","volume-title":"Distributed Programming in a Multi-Paradigm Declarative Language","author":"M. Hanus","year":"1999","unstructured":"M. Hanus. Distributed Programming in a Multi-Paradigm Declarative Language. In Proc. of PPDP\u201999, pages 376\u2013395. Springer LNCS 1702, 1999. 395"},{"key":"24_CR17","series-title":"Lect Notes Comput Sci","first-page":"47","volume-title":"A Functional Logic Programming Approach to Graphical User Interfaces","author":"M. Hanus","year":"2000","unstructured":"M. Hanus. A Functional Logic Programming Approach to Graphical User Interfaces. In Int'l Workshop on Practical Aspects of Declarative Languages, pages 47\u201362. Springer LNCS 1753, 2000. 395"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"M. Hanus and C. Prehofer. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming, 9(1):33\u201375, 1999. 383, 383, 383, 385, 386, 386, 386, 386, 386","journal-title":"Journal of Functional Programming"},{"key":"24_CR19","unstructured":"M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at http:\/\/www.informatik.uni-kiel.de\/~curry , 2000. 383, 385, 395"},{"key":"24_CR20","unstructured":"M. Hanus, S. Antoy, J. Koj, P. Niederau, R. Sadre, and F. Steiner. PAKCS 1.2: User Manual. Available at http:\/\/www.informatik.uni-kiel.de\/~pakcs , 2000. 383, 396"},{"key":"24_CR21","unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ, 1993. 381, 382, 382"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Laura Lafave. A Constraint-based Partial Evaluator for Functional Logic Programs and its Application. PhD thesis, Department of Computer Science, University of Bristol, 1998. 381","DOI":"10.1007\/3-540-49674-2_9"},{"key":"24_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-49727-7_14","volume-title":"On the Power of Homeomorphic Embedding for Online Termination","author":"M. Leuschel","year":"1998","unstructured":"M. Leuschel. On the Power of Homeomorphic Embedding for Online Termination. In G. Levi, editor, Proc. of SAS\u201998, pages 230\u2013245. Springer LNCS 1503, 1998. 392, 393"},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217\u2013242, 1991. 381, 381","journal-title":"Journal of Logic Programming"},{"key":"24_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/3-540-61580-6_16","volume-title":"A Self-Applicable Supercompiler","author":"A. P. Nemytykh","year":"1996","unstructured":"A. P. Nemytykh, V. A. Pinchuk, and V. F. Turchin. A Self-Applicable Supercompiler. In Proc. of Dagstuhl Sem. on Part. Evaluation, pages 322\u2013337. Springer LNCS 1110, 1996. 382"},{"key":"24_CR26","unstructured":"M. H. S\u00f8rensen and R. Gl\u00fcck. An Algorithm of Generalization in Positive Supercompilation. In Proc. of ILPS\u201995, pages 465\u2013479. MIT Press, 1995. 392"},{"issue":"6","key":"24_CR27","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M. H. S\u00f8rensen","year":"1996","unstructured":"M. H. S\u00f8rensen, R. Gl\u00fcck, and N. D. Jones. A Positive Supercompiler. Journal of Functional Programming, 6(6):811\u2013838, 1996. 381, 382, 389, 389","journal-title":"Journal of Functional Programming"},{"key":"24_CR28","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. 381, 389","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Artificial Intelligence","Logic for Programming and Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44404-1_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:24:01Z","timestamp":1619573041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44404-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540412854"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-44404-1_24","relation":{},"subject":[]}}