Infinite Computations in Concurrent Constraint Programming

AbstractWe present a fully abstract model for concurrent constraint programming which besides describing the results of terminating computations also describes the results of those non-terminating computations which are fair with respect to the parallel agents. The justification of the recursive definition of the model is given in terms of the least fixpoint of a function which is continuous with respect to reverse set-inclusion