Abstract
We 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
