{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:08Z","timestamp":1725664988747},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627180"},{"type":"electronic","value":"9783540684947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62718-9_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:49:37Z","timestamp":1330278577000},"page":"146-168","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing partial deduction via unfold\/fold rules"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Renault","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"A. Bossi and N. Cocco. Preserving universal termination through unfold\/fold. In Proceedings ALP '94, Lecture Notes in Computer Science 850, pages 269\u2013286. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58431-5_19"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44\u201367, January 1977.","journal-title":"Journal of the ACM"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science 883","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-58792-6_4","volume-title":"Proceedings of LOPSTR'94 and META'94","author":"J. Cook","year":"1994","unstructured":"J. Cook and J. P. Gallagher. A transformation system for definite programs based on termination analysis. In L. Fribourg and F. Turini, editors, Proceedings of LOPSTR'94 and META'94, Pisa, Italy, Lecture Notes in Computer Science 883, pages 51\u201368. Springer-Verlag, 1994."},{"key":"9_CR4","unstructured":"Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990."},{"key":"9_CR5","volume-title":"Technical Memorandum TM-0367","author":"H. Fujita","year":"1987","unstructured":"H. Fujita. An algorithm for partial evaluation with constraints. Technical Memorandum TM-0367, ICOT, Tokyo, Japan, 1987."},{"key":"9_CR6","first-page":"88","volume-title":"Tutorial on specialization of logic programs","author":"J. P. Gallagher","year":"1993","unstructured":"J. P. Gallagher. Tutorial on specialization of logic programs. In Proceedings of ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '93, Copenhagen, Denmark, pages 88\u201398. ACM Press, 1993."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"M. Gergatsoulis and M. Katzouraki. Unfold\/fold transformations for definite clause programs. In M. Hermenegildo and J. Penjam, editors, Proceedings Sixth International Symposium on Programming Language Implementation and Logic Programming (PLILP '94), Lecture Notes in Computer Science 844, pages 340\u2013354. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58402-1_24"},{"key":"9_CR8","first-page":"112","volume-title":"Lecture Notes in Computer Science 724","author":"R. Gl\u00fcck","year":"1993","unstructured":"R. Gl\u00fcck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil\u00e9, and A. Rauzy, editors, 3rd International Workshop on Static Analysis, Padova, Italy, September 1993, Lecture Notes in Computer Science 724, pages 112\u2013123. Springer-Verlag, 1993."},{"key":"9_CR9","unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993."},{"key":"9_CR10","first-page":"319","volume-title":"A conceptual embedding of folding into partial deduction: Towards a maximal integration","author":"M. Leuschel","year":"1996","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, Bonn, Germany, pages 319\u2013332. MIT Press, 1996."},{"key":"9_CR11","volume-title":"Report CW 220","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. Report CW 220, K.U. Leuven, Belgium, 1995."},{"key":"9_CR12","first-page":"63","volume-title":"Report no. 96-020 Stockholm University","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and M. H. S\u00f8rensen. Redundant argument filtering of logic programs. In J. Gallagher, editor, Logic Program Synthesis and Transformation, Proceedings LOPSTR '96, Stockholm, Sweden. Report no. 96-020 Stockholm University., pages 63\u201377. Springer-Verlag, 1996. (To appear)."},{"key":"9_CR13","doi-asserted-by":"crossref","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.","journal-title":"Journal of Logic Programming"},{"key":"9_CR14","first-page":"214","volume-title":"Workshops in Computing","author":"T. Mogensen","year":"1993","unstructured":"T. Mogensen and A. Bondorf. Logimix: A self-applicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation, Proceedings LOPSTR '92, Manchester, U.K., Workshops in Computing, pages 214\u2013227. Springer-Verlag, 1993."},{"issue":"20","key":"9_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19, 20:261\u2013320, 1994.","journal-title":"Journal of Logic Programming"},{"key":"9_CR16","volume-title":"Reducing nondeterminism while specializing logic program","author":"A. Pettorossi","year":"1997","unstructured":"A. Pettorossi, M. Proietti, and S. Renault. Reducing nondeterminism while specializing logic program. In Proc. 24-th ACM Symposium on Principles of Programming Languages, Paris, France. ACM Press, 1997. (To appear)."},{"key":"9_CR17","first-page":"111","volume-title":"Online partial deduction of large programs","author":"S. Prestwich","year":"1993","unstructured":"S. Prestwich. Online partial deduction of large programs. In Proceedings ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '93, Copenhagen, Denmark, pages 111\u2013118. ACM Press, 1993."},{"key":"9_CR18","first-page":"274","volume-title":"Semantics preserving transformation rules for Prolog","author":"M. Proietti","year":"1991","unstructured":"M. Proietti and A. Pettorossi. Semantics preserving transformation rules for Prolog. In ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, Yale University, New Haven, Connecticut, USA, pages 274\u2013284. ACM Press, 1991."},{"issue":"1","key":"9_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"M. Proietti and A. Pettorossi. Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science, 142(1):89\u2013124, 1995.","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12:7\u201351, 1993.","journal-title":"New Generation Computing"},{"key":"9_CR21","unstructured":"T. Sato and H. Tamaki. Examples of logic program transformation and synthesis. Case studies of transformation and synthesis of logic programs done up to Feb. 85, 1985."},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H. Seki","year":"1991","unstructured":"H. Seki. Unfold\/fold transformation of stratified programs. Theoretical Computer Science, 86:107\u2013139, 1991.","journal-title":"Theoretical Computer Science"},{"key":"9_CR23","first-page":"62","volume-title":"SIGPLAN Notices, 26","author":"D. A. Smith","year":"1991","unstructured":"D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pages 62\u201371. ACM Press, 1991."},{"key":"9_CR24","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 D. Sannella, editor, Fifth European Symposium on Programming Languages and Systems, ESOP '94, Lecture Notes in Computer Science 788, pages 485\u2013500. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57880-3_32"},{"key":"9_CR25","first-page":"127","volume-title":"Unfold\/fold transformation of logic programs","author":"H. Tamaki","year":"1984","unstructured":"H. Tamaki and T. Sato. Unfold\/fold transformation of logic programs. In S.-\u00c5. T\u00e4rnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, Sweden, pages 127\u2013138. Uppsala University, 1984."},{"issue":"3","key":"9_CR26","doi-asserted-by":"crossref","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 TOPLAS, 8(3):292\u2013325, 1986.","journal-title":"ACM TOPLAS"}],"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-62718-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:13Z","timestamp":1605629653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}