A program analysis which attempts to determine whether evaluation of a given expression will definitely terminate. Evaluation of a constant is bound to terminate, as is evaluation of a non-recursive function applied to arguments which are either not evaluated or which can themselves be proved to terminate. A recursive function can be shown to terminate if it can be shown that the arguments of the recursive calls are bound to reach some value at which the recursion will cease. Termination analysis can never guarantee to give the correct answer because this would be equivalent to solving the halting problem so the answer it gives is either "definitely terminates" or "don' t know". (1994-10-20)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ alt ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ au ] [ b ] [ be ] [ bo ] [ ca ] [ ch ] [ co ] [ con ] [ cons ] [ cu ] [ de ] [ do ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ Eva ] [ evaluation ] [ expression ] [ fi ] [ file ] [ finite ] [ function ] [ gi ] [ gr ] [ gu ] [ h ] [ halting problem ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ is ] [ it ] [ kn ] [ ld ] [ Lex ] [ li ] [ ls ] [ lt ] [ lu ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ om ] [ ph ] [ pl ] [ pr ] [ program ] [ pt ] [ query ] [ rc ] [ re ] [ recursion ] [ recursive ] [ ro ] [ se ] [ sh ] [ si ] [ so ] [ st ] [ T ] [ tee ] [ th ] [ to ] [ tt ] [ ua ] [ um ] [ us ] [ va ] [ value ] [ ve ] [ vi ]