J H Reppy. Concurrent Programming with events. The Concurrent ML manual. AT&T laboratories, February 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....manage processes to take advantage of the efficiency of user mode schedulers. In ML extended with first class continuations, the scheduler can be a source language program that manipulates continuations directly. This approach is very elegant and robust, and has proved successful in Concurrent ML [35] and ML Threads [9] two quite different concurrent programming environments for ML. 3 ML traps and pitfalls The syntactic and semantic pitfalls that an ML programmer encounters are much less severe and less numerous than those described in languages such as C [20] which is an egregious ....

John H. Reppy. Concurrent programming with events. Technical report, Cornell University, Dept. of Computer Science, Ithaca, NY, 1990.

....1 Introduction Many applications, such as window systems, operating systems, transaction systems, interactive games, etc. provide multiple services to one or more clients. To provide low latency service, such programs are often structured in a multi threaded fashion. Many researchers [11, 13, 14, 19, 25, 31, 39, 41, 48] are interested in adding concurrency primitives to higher order languages such as Standard ML [33] so that applications can be written in a multi threaded fashion and still take advantage of other high level features, such as strong typing, garbage collection, modules, etc. Standard ML of New ....

....thread package for uniprocessors quite easy. Uniprocessor implementations simulate concurrent thread execution, distributing access to the processor among the currently active threads, typically with the aid of a clock driven preemption mechanism. At least four such packages currently exist [14, 31, 37, 39]. Many multi threaded applications offer better latency if they are executed in truly concurrent fashion, using multiple processors. Moreover, a truly concurrent thread model can be used to express parallel algorithms designed to maximize throughput. We have designed and implemented a ....

[Article contains additional citation context not shown here]

J. H. Reppy. Concurrent programming with events. Department of Computer Science, Cornell University, July 1991.

....Signal type Number = AckReq Signal] def zero [n:Number] Create a proc representing 0 located at n def succ [m:Number n:Number] Create a proc representing m 1 at n def plus [m:Number n:Number o:Number] etc. Solution on page 100. 10.4 Programming with Events John Reppy [Rep92, Rep90, Rep88, Rep91, Rep95] has argued that the programming facilities offered by the pure Gammapi calculus and many related concurrent programming languages are inadequate in an important way: they provide insufficient support for abstraction in concurrent code. The main culprit is the restriction to ....

John Reppy. Concurrent Programming with Events. Cornell University, November 1990. the Concurrent ML Manual (Version 0.9).

....on a straightforward unification algorithm. The most complex part of the type checking algorithm deals with weak polymorphism, a restricted form of polymorphism required to handle mutable values (references and arrays) exception transmission, and communication (in extensions like Concurrent ML[28]) Standard ML of New Jersey implements a generalization of the imperative type variables described in the Definition[26, 34] In our scheme, imperative type variables are replaced by weak type variables that have an associated degree of weakness: a nonnegative integer. A type variable must be ....

....implemented by John Reppy[27] themselves expressed in terms of continuations) one can build light weight process libraries with preemptive process scheduling entirely within Standard ML of New Jersey. Two major concurrency systems have been implemented at this point: Concurrent ML by John Reppy[28] is based on CCS CSP style primitives (synchronous communication on typed channels) but introduces the novel idea of first class events. ML Threads is a system designed by Eric Cooper and Greg Morrisett[12] that provides mutual exclusion primitives for synchronization. A version of ML Threads ....

[Article contains additional citation context not shown here]

John H. Reppy. Concurrent programming with events. Technical report, Cornell University, Dept. of Computer Science, Ithaca, NY, 1990.

No context found.

J H Reppy. Concurrent Programming with events. The Concurrent ML manual. AT&T laboratories, February 1993.

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