The most general type of an expression. For example, the following are all valid types for the lambda abstraction ( x . x): Int -> Int Bool -> Bool (a->b) -> (a->b) but any valid type will be an instance of the principal type: a -> a. An instance is derived by substituting the same type expression for all occurences of some type variable. The principal type of an expression can be computed from those of its subexpressions by Robinson' s unification algorithm. (1994-12-16)

In addition suitable contents:
[ 2 ] [ = ] [ abstraction ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ B ] [ b ] [ bd ] [ be ] [ bi ] [ bs ] [ by ] [ ca ] [ cat ] [ cc ] [ ch ] [ ci ] [ co ] [ com ] [ cu ] [ de ] [ du ] [ ed ] [ er ] [ era ] [ es ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gen ] [ h ] [ hm ] [ hose ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ instance ] [ io ] [ is ] [ it ] [ la ] [ lambda abstraction ] [ Lex ] [ li ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ ns ] [ om ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ sa ] [ sam ] [ se ] [ si ] [ so ] [ st ] [ su ] [ T ] [ th ] [ tr ] [ type ] [ unification ] [ va ] [ var ] [ variable ] [ ve ] [ win ]