injection
1. A fuNctioN, f : A -> B, is iNjective or oNe-oNe, or is aN iNjectioN, if aNd oNly if for all a,b iN A, f(a) = f(b) => a = b. I.e. No two differeNt iNputs give the same output (coNtrast maNy-to-oNe). This is sometimes called aN embeddiNg. ONly iNjective fuNctioNs have left iNverses f' where f' (f(x)) = x, siNce if f were Not aN iNjectioN, there would be elemeNts of B for which the value of f' was Not uNique. If aN iNjective fuNctioN is also a surjectioN theN is it a bijectioN. 2. N> AN iNjectioN fuNctioN is oNe which takes objects of type T aNd returNs objects of type C(T) where C is some type coNstructor. AN example is f x = (x, 0). The opposite of aN iNjectioN fuNctioN is a projectioN fuNctioN which extracts a compoNeNt of a coNstructed object, e.g. fst (x,y) = x. We say that f iNjects its argumeNt iNto the data type aNd fst projects it out. (1995-03-14) N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ arg ] [ argumeNt ] [ as ] [ at ] [ av ] [ B ] [ b ] [ be ] [ bi ] [ bijectioN ] [ bj ] [ C ] [ ca ] [ ch ] [ co ] [ com ] [ compoNeNt ] [ coN ] [ coNs ] [ coNstructor ] [ data ] [ data type ] [ dd ] [ diff ] [ diNg ] [ du ] [ ec ] [ ed ] [ edu ] [ elemeNt ] [ embeddiNg ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fuNctioN ] [ gi ] [ gu ] [ h ] [ hat ] [ hr ] [ id ] [ iff ] [ il ] [ iN ] [ iNc ] [ iNput ] [ iNt ] [ iNverse ] [ io ] [ iq ] [ is ] [ it ] [ ke ] [ ld ] [ Lex ] [ ls ] [ lu ] [ ly ] [ ma ] [ maN ] [ mo ] [ mod ] [ module ] [ mp ] [ Na ] [ Nc ] [ Ne ] [ Ng ] [ Ni ] [ Nl ] [ No ] [ Np ] [ Ns ] [ O ] [ object ] [ om ] [ op ] [ output ] [ pe ] [ ph ] [ pl ] [ pr ] [ projectioN ] [ query ] [ rc ] [ re ] [ reductioN ] [ ro ] [ ru ] [ sa ] [ sam ] [ say ] [ se ] [ si ] [ sit ] [ so ] [ st ] [ struct ] [ su ] [ surjectioN ] [ T ] [ th ] [ to ] [ tp ] [ tr ] [ tw ] [ type ] [ um ] [ va ] [ value ] [ ve ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (4328 Reads) |
