Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Objects for concurrent constraint programming
Henz M., Kluwer Academic Publishers, Norwell, MA, 1998. Type: Book (9780792380382)
Date Reviewed: Aug 1 1998

Apparently, this book is a hastily prepared version of the author’s doctoral thesis, with all of the faults usually encountered in this all-too-common type of work.

Concurrent constraint programming is discussed in the context of the language OZ, developed at the Programming Systems Lab in Saarbrücken. OZ is yet another example of an object-oriented programming language, for which the author claims advantages in thread manipulation. On the basis of the tables on pages 112–113, it is hard to see why a language whose efficiency is from 3 to 20 times less than that of C++ should merit other than academic interest.

This is a book for advanced workers in the field and should be useful as a reference. It has a good index, and individual chapters are well supplied with reference material.

Reviewer:  K. Booth Review #: CR121832 (9808-0571)
Bookmark and Share
 
Constraint And Logic Languages (D.3.2 ... )
 
 
Concurrent Programming Structures (D.3.3 ... )
 
 
Constraints (D.3.3 ... )
 
 
Formal Definitions And Theory (D.3.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Constraint And Logic Languages": Date
From datalog rules to efficient programs with time and space guarantees
Liu Y., Stoller S.  Principles and practice of declaritive programming (Proceedings of the 5th ACM SIGPLAN international conference, Uppsala, Sweden, Aug 27-29, 2003)172-183, 2003. Type: Proceedings
Nov 17 2003
An unfold/fold transformation framework for definite logic programs
Roychoudhury A., Kumar K., Ramakrishnan C., Ramakrishnan I. ACM Transactions on Programming Languages and Systems 26(3): 464-509, 2004. Type: Article
Aug 17 2004
 Constraints meet concurrency
Mauro J., Atlantis Publishing Corporation, Paris, France, 2014.  170, Type: Book (978-9-462390-66-9)
Oct 1 2014

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy