In category theory, a functor F is an operator on types. F is also considered to be a polymorphic operator on functions with the type F : (a -> b) -> (F a -> F b). Functors are a generalisation of the function "map". The type operator in this case takes a type T and returns type "list of T". The map function takes a function and applies it to each element of a list. (1995-02-07)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ ca ] [ case ] [ cat ] [ category ] [ ch ] [ co ] [ con ] [ cons ] [ de ] [ du ] [ ed ] [ eg ] [ element ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ Fun ] [ function ] [ ge ] [ gen ] [ h ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ is ] [ it ] [ ke ] [ Lex ] [ li ] [ list ] [ ls ] [ ly ] [ ma ] [ map ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ns ] [ op ] [ operator ] [ pe ] [ ph ] [ pl ] [ polymorphic ] [ query ] [ rc ] [ re ] [ sa ] [ se ] [ si ] [ so ] [ st ] [ T ] [ th ] [ theory ] [ to ] [ type ]