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

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 ]