ML with Concurrency

1 Introduction.- 2 The Essence of Concurrent ML.- 2.1 Introduction.- 2.2 The Fundamental Ideas.- 2.3 Overview of CML.- 2.4 The Semantics of Mini-CML.- 2.5 Events and Their Algebra.- 2.6 Expressiveness.- 2.7 Implementing Concurrency Abstractions in CML.- 2.8 Conclusions and Related Work.- 3 Concurrency in Poly/ML.- 3.1 Introduction.- 3.2 The Poly/ML Concurrency Primitives.- 3.3 The Uniprocessor Implementation.- 3.4 A Shared Memory Multiprocessor Implementation.- 3.5 The Development of a Distributed Implementation.- 3.5.1 Additional Primitives.- 3.6 Implementation on LEMMA.- 4 CCS Programming in an ML Framework: An Account of LCS.- 4.1 Introduction.- 4.2 Features of LCS.- 4.3 Typing Behavior Expressions.- 4.4 Operational Semantics.- 4.5 The Implementation Model.- 4.6 Conclusion.- 5 FACILE—From Toy to Tool.- 5.1 Introduction.- 5.2 Design and Development of FACILE.- 5.3 Language Features.- 5.4 Implementation.- 5.5 Applications.- 5.6 Conclusion.- 6 A Semantic Theory for ML Higher-Order Concurrency Primitives.- 6.1 Motivation and Background.- 6.2 Related Work.- 6.3 Informal Presentation.- 6.4 Static Semantics.- 6.5 Dynamic Semantics.- 6.6 Conclusion.- Appendix 6.A Semantic Functions.- Appendix 6.B Semantic Rules.- 7 Communication Analysis for Concurrent ML.- 7.1 Introduction.- 7.2 Extracting the Communication Topology.- 7.3 Semantics.- 7.4 Subject Reduction Property.- 7.5 Decidability Issues.- 7.6 Conclusion.- Appendix 7.A Syntactic Properties of the Typing System.- Appendix 7.B Semantic Properties of the Ordering.- Appendix 7.C Semantic Properties of the Typing System.- Appendix 7.D Decidability Issues Concerning the Orderings.- References.