LEAST FIXED POINT

Domain	Definition
Computing	Least fixed point 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 (F bottom), .... The least fixed point is guaranteed to exist for a continuous function over a cpo. Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: LEAST FIXED POINT

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-d-e-e-f-i-i-l-n-o-p-s-t-t-x"
	-4 letters: depilations, existential, expeditions.
	-5 letters: antielites, deflations, defoliants, defoliates, depilation, depletions, detoxifies, diplotenes, disentitle, epilations, exfoliated, exfoliates, expedition, expiations, festinated, fieldstone, nodalities, penalities, pentoxides, petalodies, petitioned, plaintexts, planetoids, poinsettia, potentials, saponified, tonalities.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.