Decent Beginner Book Concurrent Programming ML (CML), included as part of the SML of New Jersey (SML/NJ) distribution, combines the best features of concurrent programming and functional programming. This practical, how-to book focuses on the use of concurrency to implement naturally concurrent applications. In addition to a tutorial introduction to programming in CML, the book presents three extended examples using CML for practical systems programming: a parallel software build system, a simple concurrent window manager, and an implementation of distributed tuple spaces. This book also illustrates advanced SML programming techniques, and includes a chapter on the implementation of concurrency using features provided by the SML/NJ system. It will be of interest to programmers, students, and professional researchers working in computer language development. My Personal Review: Ive just finished the end of the book and I will say its not too bad. A little background about me before my full review, Im a web developer with a design background, so Ive done a lot of front-end design work for clients but Ive also worked a bit of the back end with PHP, and Classic ASP. .NET was new to me and never worked with my preferred IDE, (ahem Dreamweaver) past .net 2.0, recently more and more clients are asking for ASP.net / Sharepoint work from me so Ive decided to study up on ASP.net. Strait to the point, the book isnt dry and it does what it says, it walks you thru chapter by chapter explaining every technical bit of data regarding ASP.net and occasionally telling you something interesting about one of the tools for real world use. The pros for buying this book is that you get a clear understanding of ASP.net, the history and where its going, as well as some simple tricks using VS 2008, LINQ, and ASP.net controls and forms, it also has sample code on the disc, and a PDF of the book on the CD for on-screen reference. My only problem with this book, (like so many other developer books) is that they really dont give real-world scenarios for building a e-commerce site, or a blog, or a contact form for that matter. Its a better starter book than a for Dummies or ..in 24 years but it does the job to get you started using ASP.net.

Compiling for distributed-memory machines has been a very active research area in recent years. Much of this work has concentrated on programs that use arrays as their primary data structures. To date, little work has been done to address the problem of supporting programs that use pointer-based dynamic data structures. The techniques developed for supporting SPMD execution of array-based programs rely on the fact that arrays are statically defined and directly addressable. Recursive data structures do not have these properties, so new techniques must be developed. In this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy task creation. We intend to exploit this execution model using compiler analyses and automatic parallelization techniques. We have implemented a prototype system, which we call Olden , that runs on the Intel iPSC/860 and the Thinking Machines CM-5. We discuss our implementation and report on experiments with five benchmarks.

Regular-expression derivatives are an old, but elegant, technique for compiling regular expressions to deterministic finite-state machines. It easily supports extending the regular-expression operators with boolean operations, such as intersection and complement. Unfortunately, this technique has been lost in the sands of time and few computer scientists are aware of it. In this paper, we reexamine regular-expression derivatives and report on our experiences in the context of two different functional-language implementations. The basic implementation is simple and we show how to extend it to handle large character sets (e.g., Unicode). We also show that the derivatives approach leads to smaller state machines than the traditional algorithm given by McNaughton and Yamada.

No abstract