{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:20Z","timestamp":1725663260159},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159759"},{"type":"electronic","value":"9783540396772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15975-4_38","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:24:08Z","timestamp":1330176248000},"page":"204-219","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing almost-tail-recursive prolog programs"],"prefix":"10.1007","author":[{"given":"Saumya K.","family":"Debray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/357162.357171","volume":"4","author":"J. Arsac","year":"1982","unstructured":"J. Arsac and Y. Kodratoff, \u201cSome Techniques for Recursion Removal from Recursive Functions\u201d, ACM Trans. Prog. Lang. and Systems, 4, 2 (Apr. 1982), 295\u2013322.","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"issue":"4","key":"13_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R. S. Bird","year":"1984","unstructured":"R. S. Bird, \u201cThe Promotion and Accumulation Strategies in Transformational Programming\u201d, ACM Trans. Prog. Lang. and Systems, 6, 4 (Oct. 1984), 487\u2013504.","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"13_CR3","volume-title":"Logic Programming","author":"M. Bruynooghe","year":"1982","unstructured":"M. Bruynooghe, \u201cThe Memory Management of PROLOG Implementations\u201d, in Logic Programming, K. L. Clark and S. Tarnlund, (eds.), Academic Press, London, 1982. A.P.I.C. Studies in Data Processing No. 16."},{"issue":"1","key":"13_CR4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"R. M. Burstall and J. Darlington, \u201cA Transformation System for Developing Recursive Programs\u201d, J. ACM, 24, 1 (January 1977), 44\u201367.","journal-title":"J. ACM"},{"key":"13_CR5","unstructured":"K. L. Clark and S. Sickel, \u201cPredicate Logic: a calculus for deriving programs\u201d, in Proc. IJCAI-77, Boston, 1977."},{"key":"13_CR6","volume-title":"Source-to-Source Improvement of Recursive Programs","author":"N. H. Cohen","year":"1980","unstructured":"N. H. Cohen, \u201cSource-to-Source Improvement of Recursive Programs\u201d, Ph.D. Thesis, Harvard University, Cambridge, MA, May 1980."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00263742","volume":"6","author":"J. Darlington","year":"1976","unstructured":"J. Darlington and R. M. Burstall, \u201cA System which Automatically Improves Programs\u201d, Acta Informatica, 6, (1976), 41\u201360.","journal-title":"Acta Informatica"},{"key":"13_CR8","first-page":"4","volume":"23","author":"C. J. Hogger","year":"1976","unstructured":"C. J. Hogger, \u201cDerivation of Logic Programs\u201d, J. ACM, 23, 4 (1976),.","journal-title":"J. ACM"},{"key":"13_CR9","volume-title":"Proc. 1981 Conf. Func. Prog. Langs. and Comp. Arch.","author":"R. B. Kieburtz","year":"1981","unstructured":"R. B. Kieburtz and J. Schultis, \u201cTransformations of FP Program Schemes\u201d, in Proc. 1981 Conf. Func. Prog. Langs. and Comp. Arch., ACM, Portsmouth, New Hampshire, Oct. 1981."},{"key":"13_CR10","unstructured":"M. K. Srivas, personal communication, Nov. 1984."},{"key":"13_CR11","volume-title":"Proc. 1984 ACM Symp. on LISP and Functional Programming","author":"E. St.-James","year":"1984","unstructured":"E. St.-James, \u201cRecursion is More Efficient than Iteration\u201d, in Proc. 1984 ACM Symp. on LISP and Functional Programming, Austin, Texas, Aug. 1984."},{"key":"13_CR12","volume-title":"Proc. 2nd. Logic Programming Conference","author":"H. Tamaki","year":"1984","unstructured":"H. Tamaki and T. Sato, \u201cUnfold\/Fold Transformations of Logic Programs\u201d, in Proc. 2nd. Logic Programming Conference, Uppsala, Sweden, 1984."},{"key":"13_CR13","series-title":"Research Paper","volume-title":"An improved Prolog implementation which optimises tail recursion","author":"D. H. D. Warren","year":"1980","unstructured":"D. H. D. Warren, \u201cAn improved Prolog implementation which optimises tail recursion\u201d, Research Paper 156, Dept. of Artificial Intelligence, University of Edinburgh, Scotland, 1980. Presented at the 1980 Logic Programming Workshop, Debrecen, Hungary."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15975-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:00:27Z","timestamp":1619542827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15975-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159759","9783540396772"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-15975-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}