[1] : The Free On-line Dictionary of Computing (27 SEP 03)

coalesced sum
     
         or "smash sum" in domain theory, the coalesced
        sum of domains a and b, a + b, contains all the
        non-bottom elements of both domains, tagged to show which
        part of the sum they come from, and a new bottom element.
     
         d + e =  bottomd+e 
        	   u  0,d | d in d, d /= bottomd 
        	   u  1,e | e in e, e /= bottome 
     
        the bottoms of the constituent domains are coalesced into a
        single bottom in the sum.  this may be generalised to any
        number of domains.
     
        the ordering is
     
        	bottomd+e <= v  for all v in d+e
     
        	i,v1 <= j,v2    iff i = j  v1 <= v2
     
        "<=" is usually written as latex \sqsubseteq and "+" as
        latex \oplus - a "+" in a circle.
     
        1994-12-22
     
     
see also:
domain theory domain bottom  bottomd+e   0,d | d in d, d /= bottomd   1,e | e in e, e /= bottome  
latex 

Coalesced >> C Words
Coalesced, definition of term: Coalesced
coalesced_pag1.html