coalesced sum

Computing Dictionary

coalesced sum definition

(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 = bottom(D(+)E) U (0,d) | d in D, d /= bottom(D) U (1,e) | e in E, e /= bottom(E)
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
bottom(D(+)E) (i,v1) "LaTeX \sqsubseteq and "(+)" as LaTeX \oplus - a "+" in a circle.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: coalesce
Next Definition: coalescence
Words Near: coalesced sum
More from
Synonyms and Antonyms for coalesced sum
More from
Search for articles containing coalesced sum
More from Translator Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature