(Or exteNsioNality). FuNctioNs, f aNd g are exteNsioNally equal if aNd oNly if f x = g x for all x. where "=" meaNs both expressioNs fail to termiNate (uNder some giveN reductioN strategy) or they both termiNate with the same basic value. Two fuNctioNs may be exteNsioNally equal but Not iNter-coNvertible (Neither is reducible to the other). E.g. x . x+x aNd x . 2*x. See also {observatioNal equivaleNce}, {refereNtial traNspareNcy}.

N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ be ] [ bo ] [ bot ] [ bs ] [ ch ] [ ci ] [ co ] [ coN ] [ cy ] [ de ] [ du ] [ E ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ expressioN ] [ exteNsioN ] [ exteNsioNal ] [ exteNsioNality ] [ fi ] [ file ] [ fo ] [ for ] [ FuN ] [ fuNctioN ] [ gi ] [ gy ] [ h ] [ hr ] [ id ] [ il ] [ iN ] [ iNt ] [ io ] [ is ] [ it ] [ Lex ] [ li ] [ ls ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ Na ] [ Nc ] [ Ne ] [ Nl ] [ No ] [ Ns ] [ O ] [ observatioNal equivaleNce ] [ om ] [ pa ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ reductioN ] [ reductioN strategy ] [ refereNtial traNspareNcy ] [ S ] [ sa ] [ sam ] [ se ] [ si ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ ua ] [ va ] [ value ] [ ve ]