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
asf = 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. |

Browse

Lease and release

lease giver

lease-lend

leased

leased line

Leasehold

Leaseholder

Leaser

Leash

Leasing

Leasing making

Leasow

Least

least bittern

least common multiple

least effort

**-- least fixed point --**

least of all

least recently used

least resistance

least sandpiper

least shrew

least significant bit

Least square

least squares

least upper bound

Leastways

leastwise

Leasy

Leat

Leather

Leather board

leather carp

lease giver

lease-lend

leased

leased line

Leasehold

Leaseholder

Leaser

Leash

Leasing

Leasing making

Leasow

Least

least bittern

least common multiple

least effort

least of all

least recently used

least resistance

least sandpiper

least shrew

least significant bit

Least square

least squares

least upper bound

Leastways

leastwise

Leasy

Leat

Leather

Leather board

leather carp