(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}.

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