| J. G. Morrisett. Implementing events in ML+threads. Venari Note 5, School of Computer Science, Carnegie Mellon University, 1990. Internal working paper. |
....for functional programming. Early shared memory implementations such as PFL [13] and Amber [8] led to Reppy s Concurrent ML [25] which is now being applied to systems programming (e.g. eXene [26] a multithreaded X window system toolkit) Reppy s primitives have also been implemented by Morrisett [21]. 2 The next significant step is to extend the applicationdomain of channels with choice to distributed systems. These platforms should prove a strong test of this model s utility. However, a distributed implementation of these communication primitives requires a protocol to manage the complex ....
J. G. Morrisett. Implementing events in ML+threads. Venari Note 5, School of Computer Science, Carnegie Mellon University, 1990. Internal working paper.
....difficult. Reppy gives a coroutine implementation [31] but many of the difficulties arise in the presence of true parallelism. In particular, the last problem has been a topic of quite a bit of research [8, 34, 35] Nevertheless, we have been able to implement events using the thread interface [27]. The fact that so many higher level constructs can be efficiently implemented in terms of the thread interface (with help from SML s first class functions, polymorphic types, and module system) reinforces our belief that we have chosen a good set of primitives. The advantage of our lowlevel ....
J. G. Morrisett. Implementing events in ML+Threads. Venari Note 5, School of Computer Science, Carnegie Mellon University.
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