{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:21Z","timestamp":1725455841694},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611431"},{"type":"electronic","value":"9783540683322"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0023053","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:32:44Z","timestamp":1132363964000},"page":"1-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lazy remote procedure call and its implementation in a parallel variant of C"],"prefix":"10.1007","author":[{"given":"Marc","family":"Feeley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","volume":"12","author":"G. Bilardi","year":"1989","unstructured":"G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SIAM Journal of Computing, 12(2):216\u2013228, April 1989.","journal-title":"SIAM Journal of Computing"},{"issue":"10","key":"1_CR2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/362375.362379","volume":"16","author":"D. Bobrow","year":"1973","unstructured":"D. Bobrow and B. Wegbreit. A model and stack implementation of multiple environments. Communications of the ACM, 16(10):591\u2013603, 1973.","journal-title":"Communications of the ACM"},{"key":"1_CR3","first-page":"95","volume-title":"A future-based parallel language for a general-purpose highly-parallel computer","author":"D. Callahan","year":"1989","unstructured":"D. Callahan and B. Smith. A future-based parallel language for a general-purpose highly-parallel computer. In Papers from the Second Workshop on Languages and Compilers for Parallel Computing, pages 95\u2013113. University of Illinois at Urbana-Champaign, 1989."},{"issue":"2\/3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01018696","volume":"7","author":"M. Feeley","year":"1994","unstructured":"M. Feeley, M. Turcotte, and G. Lapalme. Using Multilisp for solving constraint satisfaction problems: an application to nucleic acid 3D structure determination. Lisp and Symbolic Computation, 7(2\/3):231\u2013246, 1994.","journal-title":"Lisp and Symbolic Computation"},{"key":"1_CR5","unstructured":"M. Feeley. An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors. PhD thesis, Brandeis University Department of Computer Science, 1993. Available as publication #869 from d\u00e9partement d'informatique et recherche op\u00e9rationnelle de l'Universit\u00e9 de Montr\u00e9al."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"M. Feeley. Polling efficiently on stock hardware. In Proceedings of the 1993 ACM Conference on Functional Programming Languages and Computer Architecture, 1993.","DOI":"10.1145\/165180.165205"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"R. Halstead. Multilisp: A language for concurrent symbolic computation. In ACM Trans. on Prog. Languages and Systems, pages 501\u2013538, October 1985.","DOI":"10.1145\/4472.4478"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"P. H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C. H. Flood, W. Grieskamp, J. H. G. Van Groningen, K. Hammond, B. Hausman, M. Y. Ivory, R. E. Jones, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. R\u00f6jemo, M. Serrano, J.-P. Talpin, J. Thackray, S. Thomas, P. Weis, and P. Wentworth. Benchmarking implementations of functional languages with \u201cpseudoknot\u201d a float-intensive benchmark. To appear in Journal of Functional Programming, 1996.","DOI":"10.1017\/S0956796800001891"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"M. Katz and D. Weise. Continuing into the future: on the interaction of futures and first-class continuations. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990.","DOI":"10.1145\/91556.91628"},{"key":"1_CR10","unstructured":"E. Mohr. Dynamic Partitioning of Parallel Lisp Programs. PhD thesis, Yale University Department of Computer Science, October 1991."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"R. S. Nikhil. Cid: A parallel, shared-memory C for distributed-memory machines. In Languages and Compilers for Parallel Computing, pages 376\u2013390, August 1994.","DOI":"10.1007\/BFb0025891"},{"key":"1_CR12","unstructured":"R. W. Numrich. The Cray T3D Address Space and How to Use It. Cray Research Inc., 1994."},{"issue":"2","key":"1_CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/201059.201065","volume":"17","author":"A. Rogers","year":"1995","unstructured":"A. Rogers, M. C. Carlisle, J. H. Reppy, and L. J. Hendren. Supporting dynamic data structures on distributed-memory machines. ACM Transactions on Programming Languages and Systems, 17(2):233\u2013263, March 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"D. B. Wagner and B. G. Calder. Leapfrogging: A portable technique for implementing efficient futures. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.","DOI":"10.1145\/155332.155354"}],"container-title":["Lecture Notes in Computer Science","Parallel Symbolic Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T18:14:14Z","timestamp":1580321654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611431","9783540683322"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023053","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}