{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:01Z","timestamp":1725664441601},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_231","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:22Z","timestamp":1330276342000},"page":"726-740","source":"Crossref","is-referenced-by-count":1,"title":["Non-speculative and upward invocation of continuations in a parallel language"],"prefix":"10.1007","author":[{"given":"Luc","family":"Moreau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Jan Maluszy\u0144ski and Martin Wirsing, editors, Third International Symposium on Programming Language Implementation and Logic Programming, number 528 in Lecture Notes in Computer Science, pages 1\u201313, Passau, Germany, August 1991.","DOI":"10.1007\/3-540-54444-5_83"},{"key":"48_CR2","unstructured":"Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984."},{"key":"48_CR3","unstructured":"Marc Feeley. An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors. PhD thesis, Brandeis University, 1993."},{"key":"48_CR4","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1986","unstructured":"Matthias Felleisen and Daniel P. Friedman. Control Operators, the SECD-Machine and the \u03bb-Calculus. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 193\u2013217, Amsterdam, 1986. Elsevier Science Publishers."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Cormac Flanagan and Matthias Felleisen. The Semantics of Future and Its Use in Program Optimization. In Proceedings of the Twenty Second Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, January 1995.","DOI":"10.1145\/199448.199484"},{"key":"48_CR6","first-page":"237","volume":"28","author":"C. Flanagan","year":"1993","unstructured":"Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The Essence of Compiling with Continuations. In Proc. SIGPLAN '93 Conference on Programming Language Design and Implementation, SIGPLAN Notices, Vol. 28, pages 237\u2013247, 1993.","journal-title":"Proc. SIGPLAN '93 Conference on Programming Language Design and Implementation, SIGPLAN Notices"},{"key":"48_CR7","unstructured":"Robert H. Halstead, Jr. New Ideas in Parallel Lisp: Language Design, Implementation. In T. Ito and Robert H. Halstead, editors, Parallel Lisp: Languages and Systems. US\/Japan Workshop on Parallel Lisp. Japan., number 441 in Lecture Notes in Computer Science, pages 2\u201357. Springer-Verlag, 1990."},{"issue":"3\/4","key":"48_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0096-0551(86)90007-X","volume":"11","author":"C. T. Haynes","year":"1986","unstructured":"Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Obtaining Coroutines with Continuations. Comput. Lang., 11(3\/4):143\u2013153, 1986.","journal-title":"Comput. Lang."},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Morry Katz and Daniel 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, pages 176\u2013184, June 1990.","DOI":"10.1145\/91556.91628"},{"key":"48_CR10","first-page":"424","volume-title":"European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science","author":"L. Moreau","year":"1994","unstructured":"Luc Moreau. The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations. In European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science, pages 424\u2013438, Edinburgh, Scotland, April 1994. Springer-Verlag."},{"key":"48_CR11","unstructured":"Luc Moreau. Sound Evaluation of Parallel Functional Programs with First-Class Continuations. PhD thesis, University of Li\u00e8ge, June 1994. Also available by anonymous ftp from ftp.montefiore.ulg.ac.be in directory pub\/moreau."},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Luc Moreau and Daniel Ribbens. Sound Rules for Parallel Evaluation of a Functional Language with callce. In ACM conference on Functional Programming and Computer Architecture (FPCA'93), pages 125\u2013135, Copenhagen, June 1993.","DOI":"10.1145\/165180.165197"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Gordon D. Plotkin. Call-by-Name, Call-by-Value and the \u03bb-Calculus. Theoretical Computer Science, pages 125\u2013159, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Jonathan Rees and William Clinger, editors. Revised4 Report on the Algorithmic Language Scheme. Lisp Pointers, 4(3):1\u201355, July-September 1991.","DOI":"10.1145\/382130.382133"},{"issue":"3\/4","key":"48_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Amr Sabry and Matthias Felleisen. Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic and Computation, Special Issue on Continuations, 6(3\/4):289\u2013360, November 1993.","journal-title":"Lisp and Symbolic and Computation, Special Issue on Continuations"},{"key":"48_CR16","volume-title":"Technical Monography PRG-11","author":"C. Strachey","year":"1974","unstructured":"Christopher Strachey and Christopher P. Wadsworth. A Mathematical Semantics for Handling Full Jumps. Technical Monography PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_231.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:43Z","timestamp":1605648403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_231","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}