{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T20:50:00Z","timestamp":1673383800811},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10990-005-4877-4","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T07:09:45Z","timestamp":1132988985000},"page":"271-298","source":"Crossref","is-referenced-by-count":2,"title":["BIT: A Very Compact Scheme System for Microcontrollers"],"prefix":"10.1007","volume":"18","author":[{"given":"Danny","family":"Dub\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Feeley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4877_CR1","unstructured":"Abelson, H., Adams, N.I., Bartley, D.H., Brooks, G., Dybvig, R.K., Friedman, D.P., Halstead, R., Hanson, C., Haynes, C.T., Kohlbecker, E., Oxley, D., Pitman, K.M., Rozas, G.J., Steele, G.L., Sussman, G.J., and Wand, M. Revised4 report on the Algorithmic Language Scheme, 1991."},{"key":"4877_CR2","doi-asserted-by":"crossref","unstructured":"Bacon, D.F., Cheng, P., and Rajan, V. A Real-time garbage collector with low overhead and consistent utilization. In Proceedings of the Symposium on Principles of Programming Language, 2003, pp. 285\u2013298.","DOI":"10.1145\/604131.604155"},{"issue":"4","key":"4877_CR3","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/359460.359470","volume":"21","author":"H.G. Baker","year":"1978","unstructured":"Baker, H.G. List processing in real-time on a serial computer. Communications of the ACM, 21(4) (1978) 280\u2013294.","journal-title":"Communications of the ACM"},{"key":"4877_CR4","unstructured":"Bayer, F. LispMe implementation. http:\/\/www.lispme.de\/lispme\/index.html."},{"key":"4877_CR5","doi-asserted-by":"crossref","unstructured":"Brooks, R.A. Trading data space for reduced time and code space in real-time collection on stock hardware. In Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, 1984 pp. 108\u2013113.","DOI":"10.1145\/800055.802042"},{"key":"4877_CR6","unstructured":"Carrette, G. SIOD implementation. http:\/\/www.cs.indiana.edu\/scheme-repository\/imp\/siod.html."},{"key":"4877_CR7","unstructured":"Chen, Z. Java Card Technology for Smart Cards: Architecture and Programmer's Guide. Addison-Wesley, 2000."},{"key":"4877_CR8","unstructured":"Crettol, D. QScheme implementation. http:\/\/www.sof.ch\/dan\/qscheme\/index-e.html."},{"key":"4877_CR9","unstructured":"Dub\u00e9, D., Feeley, M., and Serrano, M. Un GC temps r\u00e9el semi-compactant. In Actes des Journ\u00e9es Francophones des Langages Applicatifs 1996, 1996."},{"key":"4877_CR10","unstructured":"Feeley, M. Gambit implementation. http:\/\/www.iro.umontreal.ca\/~gambit\/."},{"issue":"4","key":"4877_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0096-0551(92)90015-F","volume":"17","author":"M. Feeley","year":"1992","unstructured":"Feeley, M. and Lapalme, G. Closure generation based on viewing Lambda as Epsilon plus compile. Journal of Computer Languages, 17(4) (1992) 251\u2013267.","journal-title":"Journal of Computer Languages"},{"key":"4877_CR12","unstructured":"Goetter, B. Pocket Scheme implementation. http:\/\/www.mazama.net\/scheme\/pscheme.htm."},{"key":"4877_CR13","unstructured":"Goldberg, A. and Robson, D. Smalltalk-80: The Language and Its Implementation. Addison-Wesley Longman Publishing Co., Inc., 1983."},{"key":"4877_CR14","unstructured":"Gudeman, D. Representing type information in dynamically typed languages. Technical Report TR 93-27, Department of Computer Science, The University of Arizona, 1993."},{"key":"4877_CR15","unstructured":"Jaffer, A. SCM implementation. http:\/\/swissnet.ai.mit.edu\/~jaffer\/SCM.html."},{"issue":"3","key":"4877_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/301589.286861","volume":"34","author":"M. Larose","year":"1999","unstructured":"Larose, M. and Feeley, M. A compacting incremental collector and its performance in a production quality compiler. ACM SIG-PLAN Notices, 34(3) (1999) 1\u20139.","journal-title":"ACM SIG-PLAN Notices"},{"key":"4877_CR17","unstructured":"Latendresse, M. Automatic generation of compact programs and virtual machines for Scheme. In Proceedings of the Workshop on Scheme and Functional Programming. M. Felleisen (Ed.). 2000, pp. 45\u201352."},{"key":"4877_CR18","unstructured":"Latendresse, M. G\u00e9n\u00e9ration de machines virtuelles pour l'ex\u00e9cution de programmes compress\u00e9s'. Ph.D. thesis, Universit\u00e9 de Montr\u00e9al, DIRO 2000b."},{"key":"4877_CR19","doi-asserted-by":"crossref","unstructured":"Latendresse, M. and Feeley, M. Generation of fast interpreters for Huffman compressed bytecode. In Proceedings of the ACM SIGPLAN Workshop on Interpreters, Virtual Machines and Emulators 2003.","DOI":"10.1145\/858570.858574"},{"key":"4877_CR20","unstructured":"Lee, J. fools implementation. ftp:\/\/ftp.cs.indiana.edu\/pub\/scheme-repository\/imp\/fools.1.3.2.tar.gz."},{"key":"4877_CR21","unstructured":"Moriwaki, A. Mini-Scheme implementation. ftp:\/\/ftp.cs.indiana.edu\/pub\/scheme-repository\/imp\/minischeme.tar.gz."},{"issue":"1","key":"4877_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/345099.345125","volume":"22","author":"Z. Shao","year":"2000","unstructured":"Shao, Z. and Appel, A.W. Efficient and safe-for-space closure conversion. ACM Transactions on Programming Languages and Systems, 22(1) (2000) 129\u2013161.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4877_CR23","doi-asserted-by":"crossref","unstructured":"Shivers, O. The semantics of scheme control-flow analysis. In Proceedings of the Symposium on Partial Evaluation and Semantics-based Program Manipulation, 1991 pp. 190\u2013198.","DOI":"10.1145\/115865.115884"},{"key":"4877_CR24","doi-asserted-by":"crossref","unstructured":"Siebert, F. Hard Real-time garbage collection in the Jamaica Virtual Machine. In Proceedings of the Sixth International Conference on Real-Time Computing Systems and Application. Hong Kong, China, 1999 pp. 96\u2013102.","DOI":"10.1109\/RTCSA.1999.811198"},{"key":"4877_CR25","unstructured":"Smith, C. Vx-Scheme implementation. http:\/\/colin-smith.net\/vx-scheme\/."},{"key":"4877_CR26","unstructured":"Souflis, D. TinyScheme implementation. http:\/\/tinyscheme.sourceforge.net\/."},{"key":"4877_CR27","unstructured":"Wick, A.C., Wagner, M., and Klipsch, K. LEGO\/Scheme implementation. http:\/\/www.cs.indiana.edu\/~mtwagner\/legoscheme\/."},{"key":"4877_CR28","doi-asserted-by":"crossref","unstructured":"Wilson, P.R. Uniprocessor garbage collection techniques. Lecture Notes in Computer Science, 637 (1992) 1\u201342.","DOI":"10.1007\/BFb0017182"},{"key":"4877_CR29","unstructured":"Wilson, P.R. and Johnstone, M.S. Real-time non-copying garbage collection. In ACM OOPSLA Workshop on Memory Management and Garbage Collection. Washington D.C, 1993."},{"key":"4877_CR30","unstructured":"Wilson, P.R. and Johnstone, M.S. Truly Real-time non-copying garbage collection. In OOPSLA\/ECOOP Workshop on Garbage Collection in Object-Oriented Systems. E. Moss, P.R. Wilson, and B. Zorn (Eds.). 1993."},{"key":"4877_CR31","unstructured":"Yuasa, T. XS: Lisp on Lego MindStorms. In International Lisp Conference 2003, 2003."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-005-4877-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-005-4877-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-005-4877-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:40Z","timestamp":1559338180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-005-4877-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":31,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4877"],"URL":"https:\/\/doi.org\/10.1007\/s10990-005-4877-4","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}