Abstract

I have added concurrency to the functional language Standard ML. The model of concurrency is derived from CSP, but processes do not communicate directly; they interact by communicating over channels. Also, processes and channels can be created dynamically. Three features of Standard ML---polymorphism, garbage collection, and modules---work exceptionally well with concurrency. Polymorphic functions that combine the concurrent primitives can be used in many programs. One can write processes that do not explicitly provide for their own termination; the garbage collector reclaims them when they can no longer communicate. Finally, one can use the Standard ML modules system to make small adjustments in the meanings of the primitives. The implementation takes only 220 lines of Standard ML. It uses call with current continuation, callcc, to simulate concurrent execution on a sequential machine. callcc is implemented efficiently by the Standard ML of New Jersey compiler, which uses no...

Citations

3118	Communicating sequential processes - Hoare - 1978
170	Simple generational garbage collection and fast allocation. Software Practice and Experience - Appel - 1989
159	Concepts and notations for concurrent programming - Andrews, Schneider - 1983
107	Continuation-passing, closure-passing style - Appel, Jim - 1989
69	Continuation-based multiprocessing - Wand
62	A Runtime System - Appel - 1990
48	Newsqueak: A language for communicating with mice - Pike - 1989
33	Programming in occam 2 - Burns - 1987
26	The Programmable Gate Array Data - Xilinx - 1996
25	Improving garbage collector performance in virtual memory - Shaw - 1987
20	First-class synchronous operations in Standard ML - Reppy - 1989
19	Synchronous operations as first-class values - Reppy
4	Squinting at Power Series - McIlroy - 1990
1	Lectures on the implementation of Newsqueak. Given at - Pike - 1989