Lambda the Ultimate

In order to get a mathematical definition of recursive functions one needs fixpoints.

The following article describes how a certain class of recursive functions can be described via a functional whose fixpoint defines mathematically the recursive function. Furthermore it is shown that this class of recursive functions are defined via a unique fixpoints (i.e. the corresponding functional has only one fixpoint).

The article is based on the previous articles Complete lattices and closure systems, Functions and complete partial orders and Closures and fixpoints.