{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:37Z","timestamp":1762458577096},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650744"},{"type":"electronic","value":"9783540496748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49674-2_9","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T05:41:54Z","timestamp":1187070114000},"page":"168-188","source":"Crossref","is-referenced-by-count":13,"title":["Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs"],"prefix":"10.1007","author":[{"given":"L.","family":"Lafave","sequence":"first","affiliation":[]},{"given":"J. P.","family":"Gallagher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/258993.259015","volume-title":"Partial Evaluation and Semantics-Based. Program Manipulation, Amsterdam, The Netherlands, June 1997","author":"M. Alpuente","year":"1997","unstructured":"M. Alpuente, M. Falschi, P. Juli\u00e1n, and G. Vidal. Specialization of Lazy Functional Logic Programs. In Partial Evaluation and Semantics-Based. Program Manipulation, Amsterdam, The Netherlands, June 1997, pages 151\u2013162. New York: ACM, 1997."},{"key":"9_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-61055-3_28","volume-title":"Proc. of European Symp. on Programming Languages, ESOP\u201996","author":"M. Alpuente","year":"1996","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Narrowing-driven Partial Evaluation of Functional Logic Programs. In H. R. Nielson, editor, Proc. of European Symp. on Programming Languages, ESOP\u201996, pages 45\u201361. Springer LNCS 1058, 1996."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pages 238\u2013252. 1977.","DOI":"10.1145\/512950.512973"},{"key":"9_CR4","unstructured":"W.-N. Chin and S.-C. Khoo. Better Consumers for Program Specializations. Journal of Functional and Logic Programming, (4), 1996."},{"key":"9_CR5","unstructured":"Y. Futamura and K. Nogi. Generalized partial computation. In A.P. Ershov D. Bj\u00f8rner and N.D. Jones, editors, Partial Evaluation and Mixed Computation, page 133. North Holland, 1988."},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","first-page":"90","volume-title":"Constraint Programming: Basics and Trends","author":"T. Fr\u00fchwirth","year":"1994","unstructured":"T. Fr\u00fchwirth. Constraint Handling Rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 90\u2013107. Springer, 1994."},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen, B. Martens, and M. H. S\u00f8rensen. Controlling conjunctive partial deduction. In H. Kuchen and D. S. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, Lecture Notes in Computer Science, pages 137\u2013151. Springer-Verlag, 1996."},{"key":"9_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-57264-3_34","volume-title":"Static Analysis. Proceedings","author":"R. Gl\u00fcck","year":"1993","unstructured":"R. Gl\u00fcck and A. V. Klimov. Occam\u2019s razor in metacomputation: the notion of a perfect process tree. In G. Fil\u00e9 P. Cousot, M. Falaschi and A. Rauzy, editors, Static Analysis. Proceedings, volume 724 of Lecture Notes in Computer Science, pages 112\u2013123. Springer-Verlag, 1993."},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-58402-1_13","volume-title":"Programming Language Implementation and Logic Programming","author":"R. Gl\u00fcck","year":"1994","unstructured":"R. Gl\u00fcck and M. H. S\u00f8rensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming, volume 844 of Lecture Notes in Computer Science, pages 165\u2013181. Springer-Verlag, 1994."},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Partial Evaluation","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck and M.H. S\u00f8rensen. A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Partial Evaluation, volume 1110 of LNCS, Dagstuhl Castle, Germany, 1996. Springer."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"M. Hanus. A unified computation model for functional and logic programming. In Proc. 24st ACM Symposium on Principles of Programming. Languages (POPL\u201997), pages 80\u201393, 1997.","DOI":"10.1145\/263699.263710"},{"key":"9_CR12","unstructured":"N. D. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International, International Series in Computer Science, June 1993. Series editor C. A. R. Hoare."},{"key":"9_CR13","unstructured":"M. Leuschel. Extending Homeomorphic Embedding in the Contex of Logic Programming. Technical Report CW 252, Department of Computer Science, Katholieke Universiteit Leuven, June 1997 1997."},{"key":"9_CR14","unstructured":"J.W. Lloyd. Declarative Programming in Escher. Technical Report CSTR-95-013, Department of Computer Science, University of Bristol, June 1995."},{"issue":"3&4","key":"9_CR15","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(3&4):217\u2013242, October 1991.","journal-title":"Journal of Logic Programming"},{"key":"9_CR16","series-title":"Technical Report","volume-title":"An Almost Perfect Abstraction Operation for Partial Deduction Using Characteristic Trees","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel and D. De Schreye. An Almost Perfect Abstraction Operation for Partial Deduction Using Characteristic Trees. Technical Report CW 215, Departement Computerwetenschappen, K.U. Leuven, Belgium, October 1995. Accepted for Publication in New Generation Computing."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"M. Leuschel and D. De Schreye. Constrained Partial Deduction and the Preservation of Characteristic Trees. Technical report, Department of Computer Science, Katholieke Universiteit Leuven, June 1997. Accepted for publication in New Generation Computing.","DOI":"10.1007\/BF03037483"},{"key":"9_CR18","unstructured":"M. Leuschel, D. De Schreye, and A. de Waal. A Conceptual Embedding of Folding into Partial Deduction; Towards a Maximal Integration. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP\u201996, pages 319\u2013332, Bonn, Germany, September 1996. MIT Press."},{"key":"9_CR19","unstructured":"S.D. Marlow. Deforestation for Higher-Order Functional Languages. PhD thesis, University of Glasgow, 1996."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Stirling, editor, International Conference on Logic Programming, pages 597\u2013613. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0059"},{"key":"9_CR21","unstructured":"M.H. S\u00f8rensen and R. Gl\u00fcck. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Logic Programming: Proceedings of the 1995 International Symposium, pages 465\u2013479. MIT Press, 1995."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"M.H. S\u00f8rensen, R. Gl\u00fcck, and N. D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In ESOP. Springer-Verlag, 1994.s","DOI":"10.1007\/3-540-57880-3_32"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","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.","journal-title":"Journal of Functional Programming"},{"key":"9_CR24","unstructured":"M.H. S\u00f8rensen. Convergence of Program Transformers in the Metric Space of Trees With a Reflection on the Set of Reals. Unpublished manuscript."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"V. F. Turchin, R.M. Nirenberg, and D. V. Turchin. Experiments with a supercompiler. In Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pages 47\u201355. ACM, ACM, August 1982.","DOI":"10.1145\/800068.802134"},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V.F. Turchin","year":"1986","unstructured":"V.F. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292\u2013325, July 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"P. 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","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49674-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:01:54Z","timestamp":1708167714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}