This states that for any program (a non-function typed term in the typed lambda-calculus with constants) {normal order reduction} (outermost first) fails to terminate if and only if the standard semantics of the term is bottom. Moreover, if the reduction of program e1 terminates with some {head normal form} e2 then the standard semantics of e1 and e2 will be equal. This theorem is significant because it relates the operational notion of a reduction sequence and the denotational semantics of the input and output of a reduction sequence.

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ au ] [ b ] [ bd ] [ be ] [ bo ] [ bot ] [ bottom ] [ ca ] [ ch ] [ co ] [ con ] [ cons ] [ cu ] [ de ] [ denotational semantics ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ gn ] [ gr ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ input ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ lambda-calculus ] [ lc ] [ Lex ] [ ls ] [ lu ] [ ly ] [ M ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ni ] [ nl ] [ no ] [ norm ] [ normal form ] [ normal order reduction ] [ np ] [ ns ] [ om ] [ op ] [ output ] [ pe ] [ ph ] [ pr ] [ program ] [ query ] [ rational ] [ rc ] [ re ] [ reduction ] [ ro ] [ se ] [ semantics ] [ si ] [ sig ] [ so ] [ st ] [ standard ] [ standard semantics ] [ state ] [ T ] [ th ] [ to ] [ tp ] [ tt ] [ type ] [ typed lambda-calculus ] [ ua ] [ us ] [ ve ]