OnlineWoerterBuecher.de
Internes

Lexikon


discriminated union


The discriminated union of two sets A and B is A + B = U where inA and inB are arbitrary tags which specify which summand an element originates from. A type (especially an algebraic data type) might be described as a discriminated union if it is a sum type whose objects consist of a tag to say which part of the union they belong to and a value of the corresponding type. (1995-04-25)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ ai ] [ al ] [ algebra ] [ algebraic ] [ algebraic data type ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ be ] [ bi ] [ bit ] [ bj ] [ br ] [ ch ] [ ci ] [ co ] [ con ] [ cons ] [ cr ] [ data ] [ data type ] [ de ] [ ding ] [ disc ] [ du ] [ ec ] [ ed ] [ element ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ ge ] [ gh ] [ gi ] [ gs ] [ h ] [ hose ] [ hr ] [ ht ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ Lex ] [ lu ] [ ly ] [ ma ] [ man ] [ mm ] [ mo ] [ mod ] [ module ] [ na ] [ ng ] [ ni ] [ ns ] [ object ] [ om ] [ pa ] [ pe ] [ ph ] [ query ] [ rc ] [ re ] [ ro ] [ sa ] [ say ] [ sc ] [ se ] [ set ] [ si ] [ spec ] [ st ] [ su ] [ sum ] [ T ] [ tag ] [ th ] [ theory ] [ to ] [ tr ] [ tw ] [ type ] [ um ] [ union ] [ va ] [ value ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3789 Reads)

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

Page Generation in 0.0879 Seconds, with 18 Database-Queries
Zurück zur Startseite