{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:54Z","timestamp":1725664554438},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587927"},{"type":"electronic","value":"9783540491040"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58792-6_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:45:40Z","timestamp":1330274740000},"page":"51-68","source":"Crossref","is-referenced-by-count":6,"title":["A transformation system for definite programs based on termination analysis"],"prefix":"10.1007","author":[{"given":"J.","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"K.R. Apt. and D. Pedreschi. Studies in Pure Prolog: Termination. In J.W. Lloyd, editor, Proceedings of the Esprit symposium on computational logic, pages 150\u2013176, 1990.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"D. Boulanger and M. Bruynooghe. Using abstract interpretation for goal replacement. In Y. Deville, editor, Logic Program Synthesis and Tranformation (LOPSTR'93), Louvain-la-Neuve, 1993.","DOI":"10.1007\/978-1-4471-3234-9_18"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A. Bossi, N. Cocco, and S. Etalle. Transforming Normal Programs by Replacement. In Third Workshop on Metaprogramming in Logic, Uppsala., 1992. META92.","DOI":"10.1007\/3-540-56282-6_18"},{"key":"4_CR4","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:44\u201367, 1977.","journal-title":"Journal of the ACM"},{"key":"4_CR5","unstructured":"A. Bossi and S. Etalle. Transforming Acyclic Programs. ACM Transactions on Programming Languages and Systems, (to appear); also available as CWI Technical Report CS-R9369 December 1993, CWI, Amsterdam, 1994."},{"key":"4_CR6","unstructured":"M. Bezem. Characterising Termination of Logic Programs with Level Mappings. In E.L. Lusk and R.A. Overbeek, editors, Proceedings NACLP89, pages 69\u201380, 1989."},{"key":"4_CR7","unstructured":"J. Cook. A transformation system for definite logic programs based on termination analysis. Master's thesis, School of Mathematics, University of Bristol, 1992."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"D. De Schreye and K. Verschaetse. Termination of Logic Programs:Tutorial Notes. In Third Workshop on Metaprogramming in Logic, Uppsala, 1992. META92.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D. De Schreye, K. Verschaetse, and M. Bruynooghe. A Framework for Analysing the Termination of Definite Logic Programs with respect to call patterns. In ICOT, editor, Proceedings of the International Conference on Fifth Generation Computer Systems, 1992.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"4_CR10","unstructured":"P.A. Gardner and J.C. Shepherdson. Unfold\/fold transformations of logic programs. In J.L Lassez and G. Plotkin, editors, Computational Logic: Essays in Honour of Alan Robinson. MIT Press, 1991."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming, 2nd Edition. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"3","key":"4_CR12","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(3 & 4):217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"4_CR13","unstructured":"M.J. Maher. Correctness of a Logic Program Transformation System. Research Report RC13496, IBM, T.J. Watson Research Center, 1987."},{"key":"4_CR14","first-page":"503","volume-title":"Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms","author":"L. Pl\u00fcmer","year":"1992","unstructured":"L. Pl\u00fcmer. Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms. In Proceedings ILPS'91, San Diego, pages 503\u2013517. MIT Press, 1992."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"M. Proietti and A. Pettorossi. Synthesis of programs from unfold\/fold proofs. In Y. Deville, editor, Logic Program Synthesis and Tranformation (LOPSTR'93), Louvain-la-Neuve, 1993.","DOI":"10.1007\/978-1-4471-3234-9_13"},{"key":"4_CR16","volume-title":"Unfold\/Fold Transformation of Stratified Programs","author":"H. Seki","year":"1989","unstructured":"H. Seki. Unfold\/Fold Transformation of Stratified Programs. In G. Levi and M. Martelli, editors, Sixth Conference on Logic Programming, Lisboa, Portugal. The MIT Press, 1989."},{"key":"4_CR17","unstructured":"H. Tamaki and T. Sato. Unfold\/Fold Transformation of Logic Programs. In Proceedings of the Second international Logic Programming Conference, pages 127\u2013138, Uppsala, 1984."},{"issue":"2","key":"4_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"J.D. Ullman and A. Van Gelder. Efficient tests for top-down termination of logical rules. Journal of the ACM, 35(2), pages 345\u2013373, 1988.","journal-title":"Journal of the ACM"},{"key":"4_CR19","unstructured":"T. Vasak and J. Potter. Characterisation of Terminating Logic Programs. In Proceedings 1986 Symposium on Logic Programming, Salt Lake City, pages 140\u2013147, 1986."}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation \u2014 Meta-Programming in Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58792-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:30:32Z","timestamp":1640939432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58792-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587927","9783540491040"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58792-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}