Name: ML with Concurrency
Price: 320.97 RON
Availability: OnlineOnly
Author: Flemming Nielson
ISBN: 9781461274834

ML with Concurrency: Monographs in Computer Science

Flemming Nielson

Both functional and concurrent programming are relatively new paradigms with great promise. In this book, a survey is provided of extensions to Standard ML, one of the most widely used functional languages, with new primitives for concurrent programming. Computer scientists and graduate students will find this a valuable guide to this topic.

Citește tot Restrânge

Din seria Monographs in Computer Science

20%

Preț: 501^.96 lei
20%

Preț: 949^.76 lei
20%

Preț: 319^.15 lei
20%

Preț: 336^.09 lei
Preț: 385^.10 lei
20%

Preț: 1235^.26 lei
20%

Preț: 805^.66 lei
20%

Preț: 632^.01 lei
20%

Preț: 962^.27 lei
20%

Preț: 683^.76 lei
15%

Preț: 489^.45 lei
20%

Preț: 635^.90 lei
18%

Preț: 919^.67 lei
20%

Preț: 624^.95 lei
Preț: 371^.27 lei
20%

Preț: 959^.60 lei
15%

Preț: 559^.53 lei
18%

Preț: 713^.89 lei
20%

Preț: 319^.15 lei
20%

Preț: 1418^.60 lei
20%

Preț: 955^.14 lei
20%

Preț: 334^.98 lei
20%

Preț: 1396^.31 lei
20%

Preț: 619^.89 lei
20%

Preț: 965^.19 lei
20%

Preț: 1567^.33 lei
15%

Preț: 621^.97 lei
20%

Preț: 615^.94 lei
20%

Preț: 630^.68 lei
20%

Preț: 343^.86 lei
20%

Preț: 573^.07 lei
20%

Preț: 317^.70 lei
20%

Preț: 616^.39 lei
20%

Preț: 326^.55 lei
20%

Preț: 324^.28 lei
20%

Preț: 320^.55 lei
20%

Preț: 318^.35 lei
20%

Preț: 330^.66 lei
20%

Preț: 617^.38 lei
20%

Preț: 617^.20 lei
20%

Preț: 1243^.01 lei
20%

Preț: 953^.25 lei
20% $A Logical Approach to Discrete Math$

Preț: 333^.94 lei

Specificații

ISBN-13: 9781461274834
ISBN-10: 1461274834
Pagini: 272
Ilustrații: X, 255 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.42 kg
Ediția:Softcover reprint of the original 1st ed. 1997
Editura: Springer
Colecția Monographs in Computer Science
Seria Monographs in Computer Science

Locul publicării:New York, NY, United States

Cuprins

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.