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.

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