{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:00Z","timestamp":1725663780950},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544876"},{"type":"electronic","value":"9783540384014"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54487-9_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:55:14Z","timestamp":1330210514000},"page":"110-127","source":"Crossref","is-referenced-by-count":0,"title":["A fast garbage collection algorithm for WAM \u2014 based PROLOG"],"prefix":"10.1007","author":[{"given":"Igor","family":"\u0110ur\u0111anovi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/62959.62968","volume":"31","author":"K. Appleby","year":"1988","unstructured":"Appleby, K., Carlsson, M., Haridi, S., Sahlin, D., \u2018Garbage Collection for Prolog Based on WAM'. Communications of the ACM, 31(6), 719\u201341, (1988).","journal-title":"Communications of the ACM"},{"key":"7_CR2","unstructured":"Field, A.J., Harrison, G.P., \u2018Functional programming'. Addison-Wesley Publishers Ltd., (1988)."},{"issue":"8","key":"7_CR3","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1145\/359576.359583","volume":"21","author":"F.L. Morris","year":"1978","unstructured":"Morris, F.L., \u2018A time-and space-efficient garbage compaction algorithm'. Communications of the ACM, 21(8), 662\u20135, (1978).","journal-title":"Communications of the ACM"},{"key":"7_CR4","unstructured":"Warren, D.H.D., \u2018An abstract Prolog instruction set'. Artificial Inteligence Center, SRI International, (1983)."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54487-9_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:18Z","timestamp":1619572938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54487-9_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544876","9783540384014"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-54487-9_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}