{"title":"延续到未来:关于未来和一流延续的相互作用","authors":"M. Katz, D. Weise","doi":"10.1145/91556.91628","DOIUrl":null,"url":null,"abstract":"One of the nicest features of the future construct originally presented in Multilisp [2] is its near orthogonality with respect to a functional subset of Scheme [1]. Introducing futures into most functional programs does not affect the value returned, even though the parallel execution order might differ from the sequential. When futures and continuations are used in the same program, however, parallel and sequential executions can yield different results. No existing implementation of futures has yet addressed this issue. We make futures and continuations interact properly through a simple, yet important, change to the implementation of the future construct. This change causes a second problem to manifest itself: the creation of extraneous computation threads. The second problem is addressed by making an additional change to the future construct.","PeriodicalId":146478,"journal":{"name":"Workshop on Parallel Lisp","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"Continuing into the future: on the interaction of futures and first-class continuations\",\"authors\":\"M. Katz, D. Weise\",\"doi\":\"10.1145/91556.91628\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the nicest features of the future construct originally presented in Multilisp [2] is its near orthogonality with respect to a functional subset of Scheme [1]. Introducing futures into most functional programs does not affect the value returned, even though the parallel execution order might differ from the sequential. When futures and continuations are used in the same program, however, parallel and sequential executions can yield different results. No existing implementation of futures has yet addressed this issue. We make futures and continuations interact properly through a simple, yet important, change to the implementation of the future construct. This change causes a second problem to manifest itself: the creation of extraneous computation threads. The second problem is addressed by making an additional change to the future construct.\",\"PeriodicalId\":146478,\"journal\":{\"name\":\"Workshop on Parallel Lisp\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Parallel Lisp\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/91556.91628\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Parallel Lisp","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/91556.91628","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Continuing into the future: on the interaction of futures and first-class continuations
One of the nicest features of the future construct originally presented in Multilisp [2] is its near orthogonality with respect to a functional subset of Scheme [1]. Introducing futures into most functional programs does not affect the value returned, even though the parallel execution order might differ from the sequential. When futures and continuations are used in the same program, however, parallel and sequential executions can yield different results. No existing implementation of futures has yet addressed this issue. We make futures and continuations interact properly through a simple, yet important, change to the implementation of the future construct. This change causes a second problem to manifest itself: the creation of extraneous computation threads. The second problem is addressed by making an additional change to the future construct.