A transformation applied to functional programs to replace recursion with iteration. A tail-recursive function can be compiled to an iterative loop where the recursive call becomes a jump back to the start and the parameters are held in registers which are updated with new values each time around the loop. See Iteration, Tail recursion optimisation.

In addition suitable contents:
[ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ at ] [ b ] [ ba ] [ be ] [ ca ] [ ch ] [ ck ] [ co ] [ com ] [ cu ] [ date ] [ ec ] [ ed ] [ ee ] [ eg ] [ er ] [ era ] [ es ] [ et ] [ fo ] [ for ] [ function ] [ functional ] [ functional program ] [ gi ] [ gr ] [ h ] [ ie ] [ il ] [ in ] [ io ] [ is ] [ it ] [ iteration ] [ jump ] [ la ] [ ld ] [ li ] [ loop ] [ lu ] [ ma ] [ meter ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ ns ] [ om ] [ op ] [ pa ] [ param ] [ parameter ] [ pl ] [ pr ] [ program ] [ pt ] [ re ] [ recursion ] [ recursive ] [ register ] [ ro ] [ S ] [ sa ] [ si ] [ st ] [ T ] [ tar ] [ th ] [ to ] [ tr ] [ transformation ] [ um ] [ up ] [ va ] [ value ] [ ve ]