{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:12Z","timestamp":1725664992829},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:09Z","timestamp":1330294809000},"page":"152-166","source":"Crossref","is-referenced-by-count":14,"title":["Controlling conjunctive partial deduction"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[]},{"given":"Jesper","family":"J\u00f8rgensen","sequence":"additional","affiliation":[]},{"given":"Bern","family":"Martens","sequence":"additional","affiliation":[]},{"given":"Morten Heine","family":"S\u00f8rensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"11_CR1","first-page":"45","volume":"1058","author":"M. Alpuente","year":"1996","unstructured":"M. Alpuente, M. Falaschi, G. Vidal. Narrowing-driven partial evaluation of functional logic programs. ESOP'96. LNCS 1058, 45\u201361, Springer-Verlag, 1996.","journal-title":"ESOP'96."},{"issue":"1","key":"11_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(1&2):25\u201346, 1993.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"11_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/78942.78947","volume":"12","author":"A. Bossi","year":"1990","unstructured":"A. Bossi, N. Cocco, S. Dulli. A method for specializing logic programs. ACM Transactions on Programming Languages and Systems, 12(2):253\u2013302, 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe, D. De Schreye, 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":"11_CR5","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"R.M. Burstall, 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":"11_CR6","doi-asserted-by":"crossref","unstructured":"W.-N. Chin. Towards an automated tupling strategy. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation. 119\u2013132. ACM Press, 1993.","DOI":"10.1145\/154630.154643"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"O. Danvy, R. Gl\u00fcck, P. Thiemann (eds.). Partial Evaluation, LNCS 1110, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61580-6"},{"key":"11_CR8","unstructured":"D. De Schreye, M. Leuschel, B. Martens. Program specialisation for logic programs. Tutorial presented at [23]."},{"key":"11_CR9","unstructured":"N. Dershowitz, J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, 244\u2013320, Elsevier, 1992."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on specialisation of logic programs. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 88\u201398. ACM Press, 1993.","DOI":"10.1145\/154630.154640"},{"key":"11_CR11","volume-title":"Technical Report CW 226","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen, B. Martens, and M. S\u00f8rensen. Controlling conjunctive partial deduction of definite logic programs. Technical Report CW 226, Departement Computerwetenschappen, K.U. Leuven, Belgium, February 1996."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck, A.V. Klimov. Occam's razor in metacomputation: The notion of a perfect process tree. In P. Cousot, et al. (eds.), Static Analysis. LNCS 724, 112\u2013123, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57264-3"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck, M.H. S\u00f8rensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam (eds.), Programming Language Implementation and Logic Programming. LNCS 844, 165\u2013181, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58402-1"},{"key":"11_CR14","unstructured":"R. Gl\u00fcck, M.H. S\u00f8rensen. A roadmap to metacomputation by supercompilation. In [7]."},{"key":"11_CR15","unstructured":"N.D. Jones, C.K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"J. J\u00f8rgensen, M. Leuschel, B. Martens. Conjunctive partial deduction in practice. Logic Program Synthesis and Transformation 1996. To appear.","DOI":"10.1007\/3-540-62718-9_5"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog. In Symposium on Principles of Programming Languages, 255\u2013167. ACM Press, 1982.","DOI":"10.1145\/582153.582181"},{"key":"11_CR18","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"J.B. Kruskal. Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society, 95:210\u2013225, 1960.","journal-title":"Transactions of the American Mathematical Society"},{"key":"11_CR19","unstructured":"M. Leuschel, D. De Schreye, A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration, JICSLP'96, 1996. To appear."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"M. Leuschel, B. Martens. Global control for partial deduction through characteristic atoms and global trees. In [7].","DOI":"10.1007\/3-540-61580-6_13"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"M. Leuschel, M.H. S\u00f8rensen. Redundant argument filtering of logic programs, 1996. Logic Program Synthesis and Transformation 1996. To appear.","DOI":"10.1007\/3-540-62718-9_6"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd (ed.). Logic Programming: Proceedings of the 1995 International Symposium. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4301.001.0001"},{"issue":"3\u20134","key":"11_CR24","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, J.C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11(3\u20134):217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"11_CR25","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, D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 1996. 28(2):89\u2013146, 1996.","journal-title":"Journal of Logic Programming, 1996"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"B. Martens, J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling (ed.), International Conference on Logic Programming. 597\u2013611, MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0059"},{"key":"11_CR27","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19 & 20","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi, 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":"11_CR28","doi-asserted-by":"crossref","unstructured":"M. Proietti, A. Pettorossi. Unfolding \u2014 definition \u2014 folding, in this order for avoiding unnecessary variables in logic programs. In Programming Language Implementation and Logic Programming. LNCS 528, 347\u2013358, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54444-5_111"},{"key":"11_CR29","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, 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":"11_CR30","unstructured":"M.H. S\u00f8rensen, R. Gl\u00fcck. An algorithm of generalization in positive supercompilation. In [23], 465\u2013479."},{"key":"11_CR31","unstructured":"H. Tamaki, T. Sato. Unfold\/fold transformation of logic programs. In S-\u00c5. T\u00e4rnlund (ed.), International Conference on Logic Programming. 127\u2013138, 1984."},{"issue":"3","key":"11_CR32","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 Transactions on Programming Languages and Systems, 8(3):292\u2013325, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"11_CR33","unstructured":"V.F. Turchin. The algorithm of generalization in the supercompiler. In D. Bj\u00f8rner, A.P. Ershov, N.D. Jones (eds.), Partial Evaluation and Mixed Computation. 531\u2013549. North-Holland, 1988."},{"key":"11_CR34","doi-asserted-by":"crossref","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 intermediate trees. Theoretical Computer Science, 73:231\u2013248, 1990.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:45:07Z","timestamp":1713635107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}