{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:54:03Z","timestamp":1725486843938},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430926"},{"type":"electronic","value":"9783540455875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45587-6_19","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T21:19:19Z","timestamp":1182719959000},"page":"299-317","source":"Crossref","is-referenced-by-count":1,"title":["Segment Order Preserving and Generational Garbage Collection for Prolog"],"prefix":"10.1007","author":[{"given":"Ruben","family":"Vandeginste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"H. A \u00eft-Kaci. Warren\u2019s Abstract Machine: A Tutorial Reconstruction. The M I T Press, 1991. See also: http:\/\/www.isg.sfu.ca\/~hak\/documents\/wam.html .","DOI":"10.7551\/mitpress\/7160.001.0001"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01407834","volume":"19","author":"K. A. M. Ali","year":"1990","unstructured":"K. A. M. Ali and R. Karlsson. The Muse approach to OR-parallel Prolog. International Journal of Parallel Programming, 19(2):129\u2013162, Apr. 1990.","journal-title":"International Journal of Parallel Programming"},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/62959.62968","volume":"31","author":"K. Appleby","year":"1988","unstructured":"K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719\u2013741, June 1988.","journal-title":"Communications of the ACM"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0017184","volume-title":"Proceedings of IWMM\u201992: International Workshop on Memory Management","author":"Y. Bekkers","year":"1992","unstructured":"Y. Bekkers, O. Ridoux, and L. Ungaro. Dynamic memory management for sequential logic programming languages. In Y. Bekkers and J. Cohen, editors, Proceedings of IWMM\u201992: International Workshop on Memory Management, number 637 in LNCS, pages 82\u2013102. Springer-Verlag, Sept. 1992."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-58402-1_8","volume-title":"Proceedings of the Sixth International Symposium on Programming Language Implementation and Logic Programming","author":"J. Bevemyr","year":"1994","unstructured":"J. Bevemyr and T. Lindgren. A simple and efficient copying garbage collector for Prolog. In M. Hermenegildo and J. Penjam, editors, Proceedings of the Sixth International Symposium on Programming Language Implementation and Logic Programming, number 844 in LNCS, pages 88\u2013101. Springer-Verlag, Sept. 1994."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Executing query packs in ILP. In J. Cussens and A. Frisch, editors, Proceedings of the 10th International Conference on Inductive Logic Programming, number 1866 in LNAI, pages 60\u201377, Springer, July 2000.","DOI":"10.1007\/3-540-44960-4_4"},{"issue":"11","key":"19_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1145\/362790.362798","volume":"13","author":"C. J. Cheney","year":"1970","unstructured":"C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677\u2013678, Nov. 1970.","journal-title":"Communications of the ACM"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, and Dan Sahlin. Reducing sweep time for a nearly empty heap. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages, pages 378\u2013389. ACMPress, Jan. 2000.","DOI":"10.1145\/325694.325744"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"B. Demoen, G. Engels, and P. Tarau. Segment order preserving copying garbage collection for WAMb ased Prolog. In Proceedings of the 1996 ACM Symposium on Applied Computing, pages 380\u2013386. ACMPress, Feb. 1996.","DOI":"10.1145\/331119.331210"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"B. Demoen, P.-L. Nguyen. So many WAM variations, so little time. In J. Lloyd, editor, Proceedings of Computational Logic-CL2000, First International Conference, number 1861 in LNAI, pages 1240\u20131254, Springer, July 2000.","DOI":"10.1007\/3-540-44957-4_83"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"B. Demoen and K. Sagonas. CHAT is \u0398(SLG-WAM). In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, number 1705 in LNAI, pages 337\u2013357. Springer, Sept. 1999.","DOI":"10.1007\/3-540-48242-3_21"},{"key":"19_CR12","unstructured":"R. Jones and R. Lins. Garbage Collection: Algorithms for automatic memory management. John Wiley, 1996."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"X. Li. Efficient memory management in a merged heap\/stack Prolog machine. In Proceedings of the 2nd ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP\u201900), pages 245\u2013256. ACMPress, Sept. 2000.","DOI":"10.1145\/351268.351296"},{"issue":"8","key":"19_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/358141.358147","volume":"26","author":"H. Lieberman","year":"1983","unstructured":"H. Lieberman and C. Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the ACM, 26(8):419\u2013429, June 1983.","journal-title":"Communications of the ACM"},{"issue":"8","key":"19_CR15","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1145\/359576.359583","volume":"21","author":"F. L. Morris","year":"1978","unstructured":"F. L. Morris. A time-and space-efficient garbage compaction algorithm. Communications of the ACM, 21(8):662\u2013665, Aug. 1978.","journal-title":"Communications of the ACM"},{"key":"19_CR16","unstructured":"K. Sagonas and B. Demoen. From (multi-)generational to segment order preserving copying garbage collection for the WAM. K. U. Leuven CW report 303, October 2000. See http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW303.abs.html"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"H. Touati and T. Hama. A light-weight Prolog garbage collector. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS\u201988), pages 922\u2013930. OHMSHA Ltd. Tokyo and Springer-Verlag, Nov.\/Dec. 1988.","DOI":"10.21236\/ADA619775"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"R. Vandeginste and B. Demoen. The implementation of a new segment preserving and\/or (multi-)generational copying garbage collection for the WAMan d its approximation. K. U. Leuven CW report 319, July 2001. See also: http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW319.abs.html","DOI":"10.1007\/3-540-45587-6_19"},{"key":"19_CR19","series-title":"Technical Report","volume-title":"An abstract Prolog instruction set","author":"D. H. D. Warren","year":"1983","unstructured":"D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U. S. A., Oct. 1983."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45587-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T13:30:31Z","timestamp":1683898231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45587-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12,20]]},"ISBN":["9783540430926","9783540455875"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45587-6_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001,12,20]]}}}