| R. Hieb and R. Dybvig. Continuations and concurrency. ACM Sigplan Notices, 25-3, 1990. |
....of the Facile programming language. An important fallout of this formalization effort is that it becomes mathematically feasible to prove the adequacy of the various translations considered here. Control operators and continuations in a parallel framework have already been considered, e.g. in [10, 17, 19]. The notion of barbed equivalence was presented in [16] for CCS and calculus. We have shown that this notion can be usefully applied to languages such as Facile and CML. The idea that asynchronous output is enough to simulate synchronous output in a variant of the calculus is presented in ....
R. Hieb and R. Dybvig. Continuations and concurrency. ACM Sigplan Notices, 25-3, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC