{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:57Z","timestamp":1762458957719},"publisher-location":"Berlin, Heidelberg","reference-count":44,"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_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:21Z","timestamp":1330296561000},"page":"59-82","source":"Crossref","is-referenced-by-count":10,"title":["Conjunctive partial deduction in practice"],"prefix":"10.1007","author":[{"given":"Jesper","family":"J\u00f8rgensen","sequence":"first","affiliation":[]},{"given":"Michael","family":"Leuschel","sequence":"additional","affiliation":[]},{"given":"Bern","family":"Martens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1093\/logcom\/3.5.469","volume":"3","author":"K. Benkerimi","year":"1993","unstructured":"K. Benkerimi and P. M. Hill. Supporting transformations for the partial evaluation of logic programs. Journal of Logic and Computation, 3(5):469\u2013486, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","volume":"16","author":"R. Bol","year":"1993","unstructured":"R. Bol. Loop checking in partial deduction. Journal of Logic Programming, 16:25\u201346, 1993.","journal-title":"Journal of Logic Programming"},{"key":"5_CR3","first-page":"269","volume-title":"Lecture Notes in Computer Science 850","author":"A. Bossi","year":"1994","unstructured":"A. Bossi and N. Cocco. Preserving Universal Termination through Unfold\/Fold. In G. Levi and M. Rodriguez-Artalejo, editors, Proc. 4th International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 850, pages 269\u2013286, Madrid, Spain, 1994. Springer-Verlag."},{"key":"5_CR4","unstructured":"A. Bossi and N. Cocco. Replacement can Preserve Termination. In this Volume."},{"key":"5_CR5","first-page":"33","volume-title":"Lecture Notes in Computer Science 1048","author":"A. Bossi","year":"1995","unstructured":"A. Bossi, N. Cocco and S. Etalle. Transformation of Left Terminating Programs: The Reordering Problem. In M. Proietti, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, Lecture Notes in Computer Science 1048, pages 33\u201345, Utrecht, Netherlands, September 1995. Springer-Verlag."},{"issue":"4","key":"5_CR6","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1145\/183432.183434","volume":"16","author":"A. Bossi","year":"1994","unstructured":"A. Bossi and S. Etalle. Transforming Acyclic Programs. Transactions on Programming Languages and Systems, 16(4:1081\u20131096, 1994.","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"1","key":"5_CR7","doi-asserted-by":"crossref","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 during partial deduction. New Generation Computing, 11(1):47\u201379, 1992.","journal-title":"New Generation Computing"},{"issue":"1","key":"5_CR8","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, 1977.","journal-title":"Journal of the ACM"},{"key":"5_CR9","first-page":"615","volume-title":"Proceedings ILPS'95","author":"D. Schreye De","year":"1995","unstructured":"D. De Schreye, M. Leuschel, and B. Martens. Program specialisation for logic programs. Tutorial. Abstract in J. Lloyd, editor, Proceedings ILPS'95, pages 615\u2013616, Portland, Oregon, December 1995, MIT Press."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"D. A. de Waal and J. Gallagher. Specialisation of a Unification Algorithm. In K.-K. Lau and T. Clement, editors, Proceedings of LOPSTR'91, pages 205\u2013220, Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3494-7_15"},{"key":"5_CR11","first-page":"207","volume-title":"LNAI 814","author":"D. A. Waal de","year":"1994","unstructured":"D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Proceedings CADE-12, pages 207\u2013221, Nancy, France, June\/July 1994. Springer-Verlag, LNAI 814."},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S. Debray","year":"1993","unstructured":"S. Debray and N.-W. Lin. Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826\u2013875, November 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR13","series-title":"LNCS 864","first-page":"255","volume-title":"SAS'94","author":"S. Debray","year":"1994","unstructured":"S. Debray, P. L\u00f3pez Garc\u00eda, M. Hermenegildo, and N.-W. Lin. Estimating the computational cost of logic programs. In B. Le Charlier, editor, SAS'94, LNCS 864, pages 255\u2013265, Namur, Belgium, September 1994. Springer-Verlag."},{"key":"5_CR14","unstructured":"J. Gallagher and M. Bruynooghe. Some low-level source transformations for logic programs. In M. Bruynooghe, editor, Meta'90, pages 229\u2013244, Leuven, April 1990."},{"issue":"3&4","key":"5_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305\u2013333, 1991.","journal-title":"New Generation Computing"},{"key":"5_CR16","unstructured":"J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings PEPM'93, pages 88\u201398. ACM Press, 1993.","DOI":"10.1145\/154630.154640"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen, B. Martens, and M.H. S\u00f8rensen. Controlling conjunctive partial deduction of definite logic programs. In H. Kuchen and S.D. Swierstra, editors, Proceedings of the International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'96), LNCS 1140, pages 152\u2013166, Aachen, Germany, September 1996. Extended version as Technical Report CW 226, K.U. Leuven. Accessible via http:\/\/www.cs.kuleuven.ac.be\/\u223clpai.","DOI":"10.1007\/3-540-61756-6_83"},{"key":"5_CR19","volume-title":"Experiments in partial deduction. Master's thesis, Departement Computerwetenschappen","author":"T. Horv\u00e1th","year":"1993","unstructured":"T. Horv\u00e1th. Experiments in partial deduction. Master's thesis, Departement Computerwetenschappen, K.U.Leuven, Leuven, Belgium, July 1993."},{"key":"5_CR20","volume-title":"Technical report, Department of Computational Science","author":"J. Lam","year":"1990","unstructured":"J. Lam and A. Kusalik. A comparative analysis of partial deductors for pure Prolog. Technical report, Department of Computational Science, University of Saskatchewan, Canada, May 1990. Revised April 1991."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science 1048","first-page":"1","volume-title":"Logic Program Synthesis and Transformation","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel. Ecological partial deduction: Preserving characteristic trees without constraints. In M. Proietti, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, Lecture Notes in Computer Science 1048, pages 1\u201316, Utrecht, Netherlands, September 1995. Springer-Verlag."},{"key":"5_CR22","unstructured":"M. Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Accessible via http:\/\/www.cs.kuleuven.ac.be\/\u223clpai."},{"key":"5_CR23","volume-title":"Technical Report CW 215, Departement Computerwetenschappen","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. Submitted for Publication. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"5_CR24","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 Michael Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'96, pages 319\u2013332, Bonn, Germany, September 1996. MIT Press. Extended version as Technical Report CW 225, K.U. Leuven. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"5_CR25","series-title":"Technical Report CW 232","first-page":"137","volume-title":"LNCS 1140","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S.D. Swierstra, editors, Proceedings of the International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'96), LNCS 1140, pages 137\u2013151, Aachen, Germany, September 1996. Extended version as Technical Report CW 232, K.U. Leuven. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"5_CR26","series-title":"Technical Report CW 220","first-page":"263","volume-title":"LNCS 1110","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In Olivier Danvy, Robert Gl\u00fcck, and Peter Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 263\u2013283, Schlo\u00df Dagstuhl, 1996. Extended version as Technical Report CW 220, K.U. Leuven. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"5_CR27","unstructured":"M. Leuschel and M.H. S\u00f8rensen. Redundant argument filtering of logic programs. In this Volume"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"5_CR29","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. The Journal of Logic Programming, 11:217\u2013242, 1991.","journal-title":"The Journal of Logic Programming"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(95)00149-2","volume":"28","author":"B. Martens","year":"1996","unstructured":"B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 28:89\u2013146, 1996. Extended version as Technical Report CW180, Departement Computerwetenschappen, K.U.Leuven, October 1993, accessible via http:\/\/www.cs.kuleuven.ac.be\/\u223clpai.","journal-title":"Journal of Logic Programming"},{"key":"5_CR31","first-page":"597","volume-title":"Ensuring global termination of partial deduction while allowing flexible polyvariance","author":"B. Martens","year":"1995","unstructured":"B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP'95, pages 597\u2013613, Kanagawa, Japan, June 1995. MIT Press. Extended version as Technical Report CSTR-94-16, University of Bristol."},{"key":"5_CR32","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":"5_CR33","first-page":"635","volume-title":"LNCS 225","author":"D. L. Poole","year":"1986","unstructured":"D. L. Poole and R. Goebel. Gracefully adding negation and disjunction to Prolog. In E. Shapiro, editor, Proceedings ICLP'86, pages 635\u2013641, London, U.K., July 1986. Springer-Verlag, LNCS 225."},{"key":"5_CR34","volume-title":"Technical Report ECRC-92-6","author":"S. Prestwich","year":"1992","unstructured":"S. Prestwich. The PADDY partial deduction system. Technical Report ECRC-92-6, ECRC, Munich, Germany, 1992."},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"M. Proietti and A. Pettorossi. Unfolding \u2014 definition \u2014 folding, in this order for avoiding unnecessary variables in logic programs. In Proceedings PLILP'91, pages 347\u2013358. Springer-Verlag, LNCS 528, 1991.","DOI":"10.1007\/3-540-54444-5_111"},{"key":"5_CR36","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","volume":"16","author":"M. Proietti","year":"1993","unstructured":"M. Proietti and A. Pettorossi. The loop absorption and the generalization strategies for the development of logic programs and partial deduction. Journal of Logic Programming, 16:123\u2013161, 1993.","journal-title":"Journal of Logic Programming"},{"key":"5_CR37","first-page":"714","volume-title":"Completeness of some transformation strategies for avoiding unnecessary logical variables","author":"M. Proietti","year":"1994","unstructured":"M. Proietti and A. Pettorossi. Completeness of some transformation strategies for avoiding unnecessary logical variables. In P. Van Hentenryck, editor, Proceedings ICLP'94, pages 714\u2013729, Italy, June 1994. MIT Press."},{"issue":"1","key":"5_CR38","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(1):7\u201351, 1993.","journal-title":"New Generation Computing"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: An efficient purely declarative logic programming language. The Journal of Logic Programming, 1996. To Appear.","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"5_CR40","first-page":"465","volume-title":"Proceedings ILPS'95","author":"M.H. S\u00f8rensen","year":"1995","unstructured":"M.H. S\u00f8rensen and R. Gl\u00fcck. An algorithm of generalization in positive supercompilation. In J. Lloyd, editor, Proceedings ILPS'95, pages 465\u2013479, Portland, Oregon, December 1995, MIT Press."},{"key":"5_CR41","unstructured":"H. Tamaki and T. Sato. Unfold\/fold transformation of logic programs. In S-\u00c5. T\u00e4rnlund, editor, Proceedings ICLP'84, pages 127\u2013138, Uppsala, July 1984."},{"issue":"3","key":"5_CR42","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, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR43","unstructured":"V.F. Turchin. The algorithm of generalization in the supercompiler. In D. Bj\u00f8rner, A.P. Ershov and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 531\u2013549. North-Holland, 1988."},{"key":"5_CR44","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 intermediate 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-62718-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:11Z","timestamp":1605647651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}