Objects for Concurrent Constraint Programming /

Concurrent constraint programming (ccp) is a recent development in programming language design. Its central contribution is the notion of partial information provided by a shared constraint store. This constraint store serves as a communication medium between concurrent threads of control and as a v...

Full description

Bibliographic Details
Main Author: Henz, Martin
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Boston, MA : Springer US, 1998.
Series:International series in engineering and computer science ; 426.
Subjects:
Online Access:Connect to the full text of this electronic book
Description
Summary:Concurrent constraint programming (ccp) is a recent development in programming language design. Its central contribution is the notion of partial information provided by a shared constraint store. This constraint store serves as a communication medium between concurrent threads of control and as a vehicle for their synchronization. Objects for Concurrent Constraint Programming analyzes the possibility of supporting object-oriented programming in ccp. Starting from established approaches, the book covers various object models and discusses their properties. Small Oz, a sublanguage of the ccp language Oz, is used as a model language for this analysis. This book presents a general-purpose object system for Small Oz and describes its implementation and expressivity for concurrent computation. Objects for Concurrent Constraint Programming is written for programming language researchers with an interest in programming language aspects of concurrency, object-oriented programming, or constraint programming. Programming language implementors will benefit from the rigorous treatment of the efficient implementation of Small Oz. Oz programmers will get a first-hand view of the design decisions that lie behind the Oz object system.
Item Description:Electronic resource.
Physical Description:1 online resource (xxi, 171 pages)
ISBN:9781461554776 (electronic bk.)
1461554772 (electronic bk.)
ISSN:0893-3405 ;