id: 01231566
dt: a
an: 01231566
au: de Boer, Frank; Gabbrielli, M.
ti: Infinite computations in concurrent constraint programming.
so: Brookes, S. (ed.) et al., Mathematical foundations of programming
    semantics. Proceedings of the 13th annual conference, MFPS, Carnegie
    Mellon Univ., Pittsburgh, PA, USA, March 23‒26, 1997. Amsterdam:
    Elsevier, Electronic Notes in Theoretical Computer Science. 6, 16 p.
    (1997).
py: 1997
pu: Amsterdam: Elsevier
la: EN
cc: 
ut: concurrent constraint programming
ci: 
li: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume6.htm#deboer
ab: Summary: 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.
rv: