{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:45:22Z","timestamp":1725893122514},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676287"},{"type":"electronic","value":"9783540451488"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720327_12","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T12:52:22Z","timestamp":1167396742000},"page":"196-215","source":"Crossref","is-referenced-by-count":1,"title":["Making Mercury Programs Tail Recursive"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Overton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoltan","family":"Somogyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren\u2019s Abstract Machine: A Tutorial Reconstruction","author":"H. A\u00eft-Kaci","year":"1991","unstructured":"A\u00eft-Kaci, H.: Warren\u2019s Abstract Machine: A Tutorial Reconstruction. MIT Press, Cambridge (1991)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)80001-0","volume":"38","author":"P.A. Bigot","year":"1999","unstructured":"Bigot, P.A., Debray, S.: Return value placement and tail call optimization in high level languages. Journal of Logic Programming\u00a038(1), 1\u201329 (1999)","journal-title":"Journal of Logic Programming"},{"key":"12_CR3","unstructured":"Bloch, C.: Source-to-source transformation of logic programs. Master\u2019s thesis, Weizmann Institue of Science (November 1984)"},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1063\/1.4823407","volume":"9","author":"H.-J. Boehm","year":"1995","unstructured":"Boehm, H.-J.: Dynamic memory allocation and garbage collection. Computers in Physics\u00a09(3), 297\u2013303 (1995)","journal-title":"Computers in Physics"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0743-1066(87)90010-0","volume":"4","author":"D.R. Brough","year":"1987","unstructured":"Brough, D.R., Hogger, C.J.: Compiling associativity into logic programs. Journal of Logic Programming\u00a04(4), 345\u2013359 (1987)","journal-title":"Journal of Logic Programming"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF03037639","volume":"9","author":"D.R. Brough","year":"1991","unstructured":"Brough, D.R., Hogger, C.J.: Grammar-related transformations of logic programs. New Generation Computing\u00a09, 115\u2013134 (1991)","journal-title":"New Generation Computing"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcy\u00fckyildiz, H., Flener, P.: Generalised logic program transformation schemas. In: Fuchs, N.E. (ed.) Proceedings of the Seventh International Workshop on Logic Program Synthesis and Transformation, pp. 45\u201365 (1997)","DOI":"10.1007\/3-540-49674-2_3"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Debray, S.K.: Optimizing almost-tail-recursive Prolog programs. In: Proceedings of the International Symposium on Functional Programming Languages and Computer Architecture, pp. 204\u2013219 (1985)","DOI":"10.1007\/3-540-15975-4_38"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Debray, S.K.: Unfold\/fold transformations and loop optimization of logic programs. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 297\u2013307 (1988)","DOI":"10.1145\/53990.54020"},{"key":"12_CR10","unstructured":"Demoen, B., de la Banda, M.G., Harvey, W., Marriott, K., Stuckey, P.J.: Herbrand constraint solving in HAL. In: Proceedings of the Sixteenth International Conference on Logic Programming, pp. 260\u2013274 (1999)"},{"key":"12_CR11","unstructured":"Henderson, F., Conway, T., Somogyi, Z., Jeffery, D.: The Mercury language reference manual. Technical Report 96\/10, Department of Computer Science, University of Melbourne, Australia (1996)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19, 20","author":"A. Pettorossi","year":"1994","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs: Foundations and techniques. Journal of Logic Programming\u00a019, 20, 261\u2013320 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"1\u20133","key":"12_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming\u00a029(1\u20133), 17\u201364 (1996)","journal-title":"Journal of Logic Programming"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Speirs, C., Somogyi, Z., S\u00f8ndergaard, H.: Termination analysis for Mercury. In: Proceedings of the Fourth International Static Analysis Symposium, pp. 157\u2013171 (1997)","DOI":"10.1007\/BFb0032740"},{"key":"12_CR15","unstructured":"Taylor, A.: High Performance Prolog Implementation. PhD thesis, University of Sydney (1991)"},{"key":"12_CR16","unstructured":"Mercury Team. Mercury 0.9 (December 1999), Available from http:\/\/www.cs.mu.oz.au\/mercury\/"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time. In: Proceedings of ACM Symposium on Lisp and Functional Programming, pp. 45\u201352 (1984)","DOI":"10.1145\/800055.802020"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720327_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T11:17:51Z","timestamp":1587295071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720327_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676287","9783540451488"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10720327_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}