Personal tools

Impredicative types

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(See also)
(One intermediate revision by one user not shown)
Line 18: Line 18:
* [ The GHC User's Guide on impredicative polymorphism].
* [ The GHC User's Guide on impredicative polymorphism].
* [ A Pythonesque EDSL that makes use of impredicative polymorphism]
* [ A writeup of where ImpredicativePolymorphism is used in a GHC plugin to store a lookup table of strings to polymorphic functions]

Revision as of 23:19, 29 December 2012

Impredicative types are an advanced form of polymorphism, to be contrasted with rank-N types.

A standard Haskell type is universally quantified by default, and quantifiers can only appear at the top level of a type or to the right of function arrows.

A higher-rank polymorphic type allows universal quantifiers to appear to the left of function arrows as well, so that function arguments can be functions that are themselves polymorphic.

An impredicative type, on the other hand, allows universal quantifiers anywhere: in particular, may contain ordinary datatypes with polymorphic components. The GHC User's Guide gives the following example:

f :: Maybe (forall a. [a] -> [a]) -> Maybe ([Int], [Char])
f (Just g) = Just (g [3], g "hello")
f Nothing  = Nothing
Impredicative types are enabled in GHC with the
{-# LANGUAGE ImpredicativeTypes #-}
pragma. They are among the less well-used and well-tested language extensions, and so some caution is advised in their use.

See also