{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:03Z","timestamp":1725557883984},"publisher-location":"Berlin, Heidelberg","reference-count":68,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143083"},{"type":"electronic","value":"9783642143090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14309-0_6","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:09:58Z","timestamp":1277298598000},"page":"112-135","source":"Crossref","is-referenced-by-count":3,"title":["The Transformational Approach to Program Development"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerio","family":"Senni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/10705424_10","volume-title":"Functional and Logic Programming","author":"M. Alpuente","year":"1999","unstructured":"Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: A transformation system for lazy functional logic programs. In: Middeldorp, A., Sato, T. (eds.) FLOPS 1999. LNCS, vol.\u00a01722, pp. 147\u2013162. Springer, Heidelberg (1999)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"20","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. Journal of Logic Programming 19,\u00a020, 9\u201371 (1994)","journal-title":"Journal of Logic Programming 19,"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about termination of pure logic programs. Information and Computation\u00a0106, 109\u2013157 (1993)","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0743-1066(94)00104-E","volume":"24","author":"C. Aravindan","year":"1995","unstructured":"Aravindan, C., Dung, P.M.: On the correctness of unfold\/fold transformation of normal and extended logic programs. Journal of Logic Programming\u00a024(3), 201\u2013217 (1995)","journal-title":"Journal of Logic Programming"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-540-25951-0_2","volume-title":"Program Development in Computational Logic","author":"D. Basin","year":"2004","unstructured":"Basin, D., Deville, Y., Flener, P., Hamfelt, A., Fischer Nilsson, J.: Synthesis of programs in computational logic. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 30\u201365. Springer, Heidelberg (2004)"},{"issue":"1&2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0743-1066(93)90023-A","volume":"16","author":"A. Bossi","year":"1993","unstructured":"Bossi, A., Cocco, N.: Basic transformation operations which preserve computed answer substitutions of logic programs. Journal of Logic Programming\u00a016(1&2), 47\u201387 (1993)","journal-title":"Journal of Logic Programming"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-58431-5_19","volume-title":"Algebraic and Logic Programming","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Cocco, N.: Preserving universal termination through unfold\/fold. In: Rodr\u00edguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol.\u00a0850, pp. 269\u2013286. Springer, Heidelberg (1994)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/78942.78947","volume":"12","author":"A. Bossi","year":"1990","unstructured":"Bossi, A., Cocco, N., Dulli, S.: A method for specializing logic programs. ACM Transactions on Programming Languages and Systems\u00a012(2), 253\u2013302 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-56282-6_18","volume-title":"Meta-Programming in Logic","author":"A. Bossi","year":"1992","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Transforming normal programs by replacement. In: Pettorossi, A. (ed.) META 1992. LNCS, vol.\u00a0649, pp. 265\u2013279. Springer, Heidelberg (1992)"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/logcom\/6.1.79","volume":"6","author":"A. Bossi","year":"1996","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Simultaneous replacement in normal programs. Journal of Logic and Computation\u00a06(1), 79\u2013120 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-60939-3_3","volume-title":"Logic Program Synthesis and Transformation","author":"A. Bossi","year":"1996","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Transforming left-terminating programs: The reordering problem. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 33\u201345. Springer, Heidelberg (1996)"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1145\/183432.183434","volume":"16","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Etalle, S.: Transforming acyclic programs. ACM Transactions on Programming Languages and Systems\u00a016(4), 1081\u20131096 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0743-1066(89)90033-2","volume":"6","author":"M. Bruynooghe","year":"1989","unstructured":"Bruynooghe, M., De Schreye, D., Krekels, B.: Compiling control. Journal of Logic Programming\u00a06, 135\u2013162 (1989)","journal-title":"Journal of Logic Programming"},{"key":"6_CR14","first-page":"359","volume-title":"Logic Programming: Proceedings of the 1990 North American Conference","author":"M. Bugliesi","year":"1990","unstructured":"Bugliesi, M., Lamma, E., Mello, P.: Partial evaluation for hierarchies of logic theories. In: Debray, S., Hermenegildo, M. (eds.) Logic Programming: Proceedings of the 1990 North American Conference, Austin, Texas, October 1990, pp. 359\u2013376. MIT Press, Cambridge (1990)"},{"key":"6_CR15","first-page":"645","volume-title":"Logic Programming: Proceedings of the North American Conference 1989","author":"M. Bugliesi","year":"1989","unstructured":"Bugliesi, M., Rossi, F.: Partial evaluation in Prolog: Some Improvements about Cut. In: Lusk, E.L., Overbeek, R.A. (eds.) Logic Programming: Proceedings of the North American Conference 1989, Cleveland, Ohio, October 1989, pp. 645\u2013660. MIT Press, Cambridge (1989)"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-76274-1_8","volume-title":"Computational Logic, Symposium Proceedings","author":"A. Bundy","year":"1990","unstructured":"Bundy, A., Smaill, A., Wiggins, G.: The synthesis of logic programs from inductive proofs. In: Lloyd, J.W. (ed.) Computational Logic, Symposium Proceedings, Brussels, November 1990, pp. 135\u2013149. Springer, Berlin (1990)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM\u00a024(1), 44\u201367 (1977)","journal-title":"Journal of the ACM"},{"key":"6_CR18","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"issue":"2\u20133","key":"6_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"De Schreye, D., Gl\u00fcck, R., J\u00f8rgensen, J., Leuschel, M., Martens, B., S\u00f8rensen, M.H.: Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Journal of Logic Programming\u00a041(2\u20133), 231\u2013277 (1999)","journal-title":"Journal of Logic Programming"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-15975-4_38","volume-title":"Functional Programming Languages and Computer Architecture","author":"S.K. Debray","year":"1985","unstructured":"Debray, S.K.: Optimizing almost-tail-recursive Prolog programs. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.\u00a0201, pp. 204\u2013219. Springer, Heidelberg (1985)"},{"issue":"3","key":"6_CR21","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s100090100049","volume":"3","author":"G. Delzanno","year":"2001","unstructured":"Delzanno, G., Podelski, A.: Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer\u00a03(3), 250\u2013270 (2001)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(95)00148-4","volume":"166","author":"S. Etalle","year":"1996","unstructured":"Etalle, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical Computer Science\u00a0166, 101\u2013146 (1996)","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/258993.259014","volume-title":"PEPM 1997","author":"S. Etalle","year":"1997","unstructured":"Etalle, S., Gabbrielli, M., Marchiori, E.: A transformation system for CLP with dynamic scheduling and CCP. In: PEPM 1997, pp. 137\u2013150. ACM Press, New York (1997)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1145\/503502.503504","volume":"23","author":"S. Etalle","year":"2001","unstructured":"Etalle, S., Gabbrielli, M., Meo, M.C.: Transformations of ccp programs. ACM Transactions on Programming Languages and Systems\u00a023(3), 304\u2013395 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR25","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Verifying CTL properties of infinite state systems by specializing constraint logic programs. In: Proceedings of the ACM Sigplan Workshop on Verification and Computational Logic VCL 2001, Florence (Italy), Technical Report DSSE-TR-2001-3, pp. 85\u201396. University of Southampton, UK (2001)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","first-page":"292","volume-title":"Program Development in Computational Logic","author":"F. Fioravanti","year":"2004","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Transformation rules for locally stratified constraint logic programs. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 292\u2013340. Springer, Heidelberg (2004)"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jsco.1999.0348","volume":"30","author":"P. Flener","year":"2000","unstructured":"Flener, P., Lau, K.-K., Ornaghi, M., Richardson, J.: An abstract formalization of correct schemas for program synthesis. Journal of Symbolic Computation\u00a030(1), 93\u2013127 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR28","unstructured":"Gallagher, J.P.: Transforming programs by specialising interpreters. In: Proceedings Seventh European Conference on Artificial Intelligence, ECAI 1986, pp. 109\u2013122 (1986)"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/154630.154640","volume-title":"Proceedings of the 1993 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM 1993","author":"J.P. Gallagher","year":"1993","unstructured":"Gallagher, J.P.: Tutorial on specialisation of logic programs. In: Proceedings of the 1993 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM 1993, Copenhagen, Denmark, pp. 88\u201398. ACM Press, New York (1993)"},{"key":"6_CR30","first-page":"565","volume-title":"Computational Logic, Essays in Honor of Alan Robinson","author":"P.A. Gardner","year":"1991","unstructured":"Gardner, P.A., Shepherdson, J.C.: Unfold\/fold transformations of logic programs. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, pp. 565\u2013583. MIT, Cambridge (1991)"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/322248.322258","volume":"28","author":"C.J. Hogger","year":"1981","unstructured":"Hogger, C.J.: Derivation of logic programs. Journal of the ACM\u00a028(2), 372\u2013392 (1981)","journal-title":"Journal of the ACM"},{"key":"6_CR32","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Komorowski, H.J.: Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog. In: Ninth ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, pp. 255\u2013267 (1982)","DOI":"10.1145\/582153.582181"},{"issue":"1","key":"6_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02576192","volume":"19","author":"L. Kott","year":"1982","unstructured":"Kott, L.: The McCarthy\u2019s induction principle: \u2018oldy\u2019 but \u2018goody\u2019. Calcolo\u00a019(1), 59\u201369 (1982)","journal-title":"Calcolo"},{"issue":"8","key":"6_CR35","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Communications of the ACM"},{"key":"6_CR36","first-page":"480","volume-title":"Proceedings of the 1995 International Logic Programming Symposium (ILPS 1995)","author":"K.-K. Lau","year":"1995","unstructured":"Lau, K.-K., Ornaghi, M., Pettorossi, A., Proietti, M.: Correctness of logic program transformation based on existential termination. In: Lloyd, J.W. (ed.) Proceedings of the 1995 International Logic Programming Symposium (ILPS 1995), pp. 480\u2013494. MIT Press, Cambridge (1995)"},{"issue":"4&5","key":"6_CR37","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S147106840200145X","volume":"2","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming\u00a02(4&5), 461\u2013515 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2&3","key":"6_CR38","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF03037139","volume":"6","author":"G. Levi","year":"1988","unstructured":"Levi, G., Sardu, G.: Partial evaluation of meta programs in a multiple worlds logic language. New Generation Computing\u00a06(2&3), 227\u2013248 (1988)","journal-title":"New Generation Computing"},{"key":"6_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","volume":"110","author":"M.J. Maher","year":"1993","unstructured":"Maher, M.J.: A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science\u00a0110, 377\u2013403 (1993)","journal-title":"Theoretical Computer Science"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z. Manna","year":"1980","unstructured":"Manna, Z., Waldinger, R.: A deductive approach to program synthesis. ACM Toplas\u00a02, 90\u2013121 (1980)","journal-title":"ACM Toplas"},{"key":"6_CR42","unstructured":"The MAP transformation system (1995\u20132010), http:\/\/www.iasi.cnr.it\/~proietti\/system.html"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/800055.802044","volume-title":"ACM Symposium on Lisp and Functional Programming","author":"A. Pettorossi","year":"1984","unstructured":"Pettorossi, A.: A powerful strategy for deriving efficient programs by transformation. In: ACM Symposium on Lisp and Functional Programming, pp. 273\u2013281. ACM Press, New York (1984)"},{"issue":"2&3","key":"6_CR44","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0743-1066(99)00029-1","volume":"41","author":"A. Pettorossi","year":"1999","unstructured":"Pettorossi, A., Proietti, M.: Synthesis and transformation of logic programs using unfold\/fold proofs. Journal of Logic Programming\u00a041(2&3), 197\u2013230 (1999)","journal-title":"Journal of Logic Programming"},{"key":"6_CR45","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-44957-4_41","volume-title":"Computational Logic - CL 2000","author":"A. Pettorossi","year":"2000","unstructured":"Pettorossi, A., Proietti, M.: Perfect model checking via unfold\/fold transformations. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 613\u2013628. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"6_CR46","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10990-005-7008-3","volume":"18","author":"A. Pettorossi","year":"2005","unstructured":"Pettorossi, A., Proietti, M., Renault, S.: Derivation of efficient logic programs by specialization and reduction of nondeterminism. Higher-Order and Symbolic Computation\u00a018(1-2), 121\u2013210 (2005)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11799573_15","volume-title":"Logic Programming","author":"A. Pettorossi","year":"2006","unstructured":"Pettorossi, A., Proietti, M., Senni, V.: Proving properties of constraint logic programs by eliminating existential variables. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 179\u2013195. Springer, Heidelberg (2006)"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-74610-2_25","volume-title":"Logic Programming","author":"A. Pettorossi","year":"2007","unstructured":"Pettorossi, A., Proietti, M., Senni, V.: Automatic correctness proofs for logic program transformations. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 364\u2013379. Springer, Heidelberg (2007)"},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/115865.115895","volume-title":"1991 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM 1991","author":"M. Proietti","year":"1991","unstructured":"Proietti, M., Pettorossi, A.: Semantics preserving transformation rules for Prolog. In: 1991 ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM 1991, Yale University, New Haven, Connecticut, USA, pp. 274\u2013284. ACM Press, New York (1991)"},{"issue":"1","key":"6_CR50","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"6_CR51","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0049-237X(08)71116-9","volume-title":"Handbook of Mathematical Logic","author":"M.O. Rabin","year":"1977","unstructured":"Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 595\u2013629. North-Holland, Amsterdam (1977)"},{"issue":"3","key":"6_CR52","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054102001175","volume":"13","author":"A. Roychoudhury","year":"2002","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato style unfold\/fold transformations for normal logic programs. International Journal on Foundations of Computer Science\u00a013(3), 387\u2013403 (2002)","journal-title":"International Journal on Foundations of Computer Science"},{"key":"6_CR53","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/982158.982160","volume":"26","author":"A. Roychoudhury","year":"2004","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: An unfold\/fold transformation framework for definite logic programs. ACM Transactions on Programming Languages and Systems\u00a026, 264\u2013509 (2004)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-46419-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Roychoudhury","year":"2000","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A.: Verification of parameterized systems using logic program transformations. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 172\u2013187. Springer, Heidelberg (2000)"},{"key":"6_CR55","first-page":"271","volume-title":"Proceedings Information Processing 1986","author":"S. Safra","year":"1986","unstructured":"Safra, S., Shapiro, E.: Meta interpreters for real. In: Kugler, H.J. (ed.) Proceedings Information Processing 1986, pp. 271\u2013278. North-Holland, Amsterdam (1986)"},{"key":"6_CR56","unstructured":"Sato, T., Tamaki, H.: Transformational logic program synthesis. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 195\u2013201. ICOT (1984)"},{"key":"6_CR57","unstructured":"Seki, H.: A comparative study of the well-founded and the stable model semantics: Transformation\u2019s viewpoint. In: Proceedings of the Workshop on Logic Programming and Non-monotonic Logic, pp. 115\u2013123. Cornell University (1990)"},{"key":"6_CR58","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H. Seki","year":"1991","unstructured":"Seki, H.: Unfold\/fold transformation of stratified programs. Theoretical Computer Science\u00a086, 107\u2013139 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"6_CR59","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","volume":"16","author":"H. Seki","year":"1993","unstructured":"Seki, H.: Unfold\/fold transformation of general logic programs for well-founded semantics. Journal of Logic Programming\u00a016(1&2), 5\u201323 (1993)","journal-title":"Journal of Logic Programming"},{"key":"6_CR60","series-title":"Lecture Notes in Computer Science","first-page":"82","volume-title":"LOPSTR 2009","author":"H. Seki","year":"2009","unstructured":"Seki, H.: On inductive and coinductive proofs via unfold\/fold transformations. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 82\u201396. Springer, Heidelberg (2009)"},{"key":"6_CR61","first-page":"20","volume-title":"Proceedings of 3rd International Symposium on Logic Programming","author":"L. Sterling","year":"1986","unstructured":"Sterling, L., Beer, R.D.: Incremental flavour-mixing of meta-interpreters for expert system construction. In: Proceedings of 3rd International Symposium on Logic Programming, Salt Lake City, Utah, USA, pp. 20\u201327. IEEE Press, Los Alamitos (1986)"},{"key":"6_CR62","doi-asserted-by":"crossref","unstructured":"Tacchella, P., Gabbrielli, M., Meo, M.C.: Unfolding in CHR. In: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2007), pp. 179\u2013186 (2007)","DOI":"10.1145\/1273920.1273945"},{"key":"6_CR63","first-page":"415","volume-title":"Proceedings of Information Processing 1986","author":"A. Takeuchi","year":"1986","unstructured":"Takeuchi, A., Furukawa, K.: Partial evaluation of Prolog programs and its application to meta-programming. In: Kugler, H.J. (ed.) Proceedings of Information Processing 1986, pp. 415\u2013420. North-Holland, Amsterdam (1986)"},{"key":"6_CR64","first-page":"127","volume-title":"Proceedings of the Second International Conference on Logic Programming (ICLP 1984)","author":"H. Tamaki","year":"1984","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S.-\u00c5. (ed.) Proceedings of the Second International Conference on Logic Programming (ICLP 1984), pp. 127\u2013138. Uppsala University, Uppsala (1984)"},{"key":"6_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-60939-3_5","volume-title":"Logic Program Synthesis and Transformation","author":"F. Toni","year":"1996","unstructured":"Toni, F., Kowalski, R.: An argumentation-theoretic approach to logic program transformation. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 61\u201375. Springer, Heidelberg (1996)"},{"key":"6_CR66","first-page":"91","volume-title":"Proceedings of ECAI 1984","author":"R. Venken","year":"1984","unstructured":"Venken, R.: A Prolog meta-interpretation for partial evaluation and its application to source-to-source transformation and query optimization. In: O\u2019Shea, T. (ed.) Proceedings of ECAI 1984, pp. 91\u2013100. North-Holland, Amsterdam (1984)"},{"key":"6_CR67","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P.L. Wadler","year":"1990","unstructured":"Wadler, P.L.: Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science\u00a073, 231\u2013248 (1990)","journal-title":"Theoretical Computer Science"},{"key":"6_CR68","unstructured":"Zhang, J., Grant, P.W.: An automatic difference-list transformation algorithm for Prolog. In: Proceedings 1988 European Conference on Artificial Intelligence, ECAI 1988, pp. 320\u2013325. Pitman (1988)"}],"container-title":["Lecture Notes in Computer Science","A 25-Year Perspective on Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14309-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:01Z","timestamp":1606186261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14309-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143083","9783642143090"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14309-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}