. The UniForM Concurrency Toolkit is a comprehensive library of abstract data types for shared memory and message passing communication that extends Concurrent Haskell with a concept of dynamic types, thread identity, thread local state and selective communication as found in CML. Notable features of the toolkit are its support for reentrant monitors, interactors providing iterative choice and the uniform representation of internal channel events as well as external tool events of the environment in the form of first class synchronous event values. 1 Introduction The UniForM Concurrency ToolKit 1 has primarily been designed to support the development of reactive systems using Concurrent Haskell [PJGF96]. The toolkit provides, partially backed up by a class system, a number of archetypical shared memory abstractions such as semaphores, locks and shared variables. The most important contribution, however, is the concept of reentrant monitors, whose main advantage over MVar's is that r...

. The UniForM Workbench is an open ended tool integration framework for developing (formal) Software Development Environments (SDE) from the basis of pre-fabricated off-the-shelf development tools. The integration framework provides support for data, control and presentation integration as well as utilities for wrapping Haskell interfaces around existing development tools. Entire SDE's are then glued together on the basis of these encapsulations using Concurrent Haskell as the integration language, thus allowing integration to be done at a level of abstraction that is very close to the one offered by constructive formal specifications. So far, the integration framework has successfully been used to integrate tools for Haskell program development as well as specification and proof tools for Z specifications. During the 80's there were several attempts to provide environments for synthesizing tightly integrated SDE's from the basis of abstract language specifications. The Sy...

1 Introduction The UniForM Concurrency ToolKit 1 is a library of abstract data types for shared memory and message passing communication that extends Concurrent Haskell [HPJW92, PJGF96] with a concept of thread identity, re-entrant monitors and selective communication. The message passing model is very similar to the one of Concurrent ML [Rep92] by representing events in terms of first class composable event values that can be combined using guarded choice and the event-action combinator. However, the toolkit extends CML with infix operators, post-conditions and an implementation of message queues that is hardwired into the protocol for selective communication rather than being simulated using an active buffer thread. This implementation scales better. The UniForM Concurrency ToolKit is implemented on top of the lean basis provided by Concurrent Haskell, namely threads and MVar's. It is currently running under GHC, version 3.0 [Tea98]. A rationale for the UniForM Concurrency ToolKi...