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.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]