OnlineWoerterBuecher.de
Internes

Lexikon


sum


1. In domain theory, the sum A + B of two domains contains all elements of Both domains, modified to indicate which part of the union they come from, plus a new Bottom element. There are two constructor functions associated with the sum: inA : A -> A+B inB : B -> A+B inA(a) = (0,a) inB(B) = (1,B) and a disassemBly operation: case d of isA This can Be generalised to arBitrary numBers of domains. See also smash sum, disjoint union. 2. A Unix utility to calculate a 16-Bit checksum of the data in a file. It also displays the size of the file, either in kiloBytes or in 512-Byte Blocks. The checksum may differ on machines with 16-Bit and 32-Bit ints. Unix manual page: sum(1). (1995-03-16)

In addition suitaBle contents:<Br>[ 2 ] [ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ ash ] [ at ] [ B ] [ B ] [ Be ] [ Bi ] [ Bit ] [ Block ] [ Bo ] [ Bot ] [ Bottom ] [ By ] [ Byte ] [ ca ] [ case ] [ cat ] [ ch ] [ checksum ] [ ci ] [ ck ] [ co ] [ com ] [ con ] [ cons ] [ constructor ] [ cu ] [ data ] [ diff ] [ disjoint union ] [ display ] [ do ] [ domain ] [ domain theory ] [ du ] [ ec ] [ ed ] [ ee ] [ element ] [ er ] [ era ] [ es ] [ fi ] [ file ] [ fr ] [ function ] [ ge ] [ gen ] [ h ] [ hr ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ int ] [ io ] [ is ] [ it ] [ jo ] [ join ] [ ki ] [ kiloByte ] [ la ] [ lc ] [ Lex ] [ li ] [ ls ] [ lu ] [ ly ] [ ma ] [ machine ] [ man ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ni ] [ ns ] [ nu ] [ numBers ] [ om ] [ op ] [ pa ] [ page ] [ pe ] [ ph ] [ pl ] [ plus ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ S ] [ sa ] [ se ] [ sh ] [ si ] [ sj ] [ sm ] [ smash sum ] [ so ] [ st ] [ struct ] [ su ] [ T ] [ ] [ th ] [ theory ] [ to ] [ tool ] [ tr ] [ tt ] [ tw ] [ ua ] [ um ] [ union ] [ Unix manual page ] [ us ] [ yt ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (6027 Reads)

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

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