OnlineWoerterBuecher.de
Internes

Lexikon


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 = bottom U U 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) <= 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)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ ash ] [ B ] [ b ] [ be ] [ bo ] [ bot ] [ bottom ] [ bs ] [ ch ] [ ci ] [ cl ] [ co ] [ com ] [ con ] [ cons ] [ D ] [ de ] [ do ] [ domain ] [ domain theory ] [ du ] [ E ] [ ed ] [ element ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ ge ] [ gen ] [ gl ] [ h ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ int ] [ ir ] [ is ] [ it ] [ LaTeX ] [ Lex ] [ li ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ ne ] [ ng ] [ no ] [ ns ] [ nu ] [ O ] [ om ] [ op ] [ ordering ] [ pa ] [ ph ] [ pl ] [ plus ] [ query ] [ rc ] [ re ] [ ro ] [ sc ] [ se ] [ set ] [ sh ] [ si ] [ sm ] [ smash sum ] [ sqsubseteq ] [ st ] [ su ] [ subseteq ] [ sum ] [ T ] [ tag ] [ th ] [ theory ] [ to ] [ tt ] [ ua ] [ um ] [ us ] [ X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3904 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1989 Seconds, with 17 Database-Queries
Zurück zur Startseite