OnlineWoerterBuecher.de
Internes

Lexikon


partial function


A fuNctioN which is Not defiNed for all argumeNts of its iNput type. E.g. f(x) = 1/x if x /= 0. The opposite of a total fuNctioN. IN {deNotatioNal semaNtics}, a partial fuNctioN f : D -> C may be represeNted as a total fuNctioN ft : D' -> lift(C) where D' is a superset of D aNd ft x = f x if x iN D ft x = bottom otherwise where lift(C) = C U bottom. Bottom (LaTeX perp) deNotes "uNdefiNed". (1995-02-03)

N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ arg ] [ argumeNt ] [ as ] [ at ] [ B ] [ b ] [ be ] [ bo ] [ bot ] [ bottom ] [ C ] [ ch ] [ D ] [ de ] [ deNotatioNal semaNtics ] [ du ] [ E ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fuNctioN ] [ gu ] [ h ] [ hr ] [ id ] [ il ] [ iN ] [ iNput ] [ io ] [ is ] [ it ] [ LaTeX ] [ Lex ] [ li ] [ ma ] [ maN ] [ mo ] [ mod ] [ module ] [ Na ] [ Nc ] [ Ne ] [ No ] [ Np ] [ om ] [ op ] [ pa ] [ pe ] [ perp ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ rw ] [ se ] [ semaNtics ] [ set ] [ si ] [ sit ] [ su ] [ T ] [ ] [ th ] [ to ] [ total fuNctioN ] [ tt ] [ type ] [ um ] [ up ] [ X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2914 Reads)

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

Page Generation in 0.0944 Seconds, with 16 Database-Queries
Zurück zur Startseite