OnlineWoerterBuecher.de
Internes

Lexikon


least fixed point


S> A function f may have many fixed pointS (x Such that f x = x). For example, any value iS a fixed point of the identity function, ( x . x). If f iS recurSive, we can repreSent it aS f = fix F where F iS Some higher-order function and fix F = F (fix F). The Standard denotational SemanticS of f iS then given by the leaSt fixed point of F. ThiS iS the leaSt upper bound of the infinite Sequence (the aScending Kleene chain) obtained by repeatedly applying F to the totally undefined value, bottom. I.e. fix F = LUB bottom, F bottom, F . The leaSt fixed point iS guaranteed to exiSt for a continuouS function over a cpo. (2005-04-12)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ aS ] [ at ] [ av ] [ B ] [ b ] [ bo ] [ bot ] [ bottom ] [ bt ] [ by ] [ ca ] [ ch ] [ chain ] [ co ] [ con ] [ cpo ] [ cu ] [ de ] [ denotational SemanticS ] [ ding ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ eS ] [ fi ] [ file ] [ finite ] [ fix ] [ fixed point ] [ fo ] [ for ] [ function ] [ gh ] [ gi ] [ gu ] [ h ] [ hat ] [ higher-order function ] [ hr ] [ id ] [ il ] [ in ] [ infinite ] [ int ] [ io ] [ iS ] [ it ] [ K ] [ leaSt upper bound ] [ Lex ] [ lu ] [ ly ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ nu ] [ om ] [ pe ] [ ph ] [ pl ] [ ply ] [ point ] [ pr ] [ query ] [ rc ] [ re ] [ recurSive ] [ repeat ] [ Sc ] [ Se ] [ SemanticS ] [ Si ] [ So ] [ St ] [ Standard ] [ Su ] [ T ] [ tee ] [ th ] [ to ] [ tt ] [ ua ] [ up ] [ upper bound ] [ uS ] [ va ] [ value ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4680 Reads)

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

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