FP (programming Language) - Equational Functions

Equational Functions

In addition to being constructed from primitives by functionals, a function may be defined recursively by an equation, the simplest kind being:

fEf

where E'f is an expression built from primitives, other defined functions, and the function symbol f itself, using functionals.

Read more about this topic:  FP (programming Language)

Famous quotes containing the word functions:

    Let us stop being afraid. Of our own thoughts, our own minds. Of madness, our own or others’. Stop being afraid of the mind itself, its astonishing functions and fandangos, its complications and simplifications, the wonderful operation of its machinery—more wonderful because it is not machinery at all or predictable.
    Kate Millett (b. 1934)