Copyright | (c) 2003 - 2006 Wolfgang Lux 2014 - 2015 Jan Tikovsky 2016 Finn Teegen |
---|---|
License | BSD-3-clause |
Maintainer | bjp@informatik.uni-kiel.de |
Stability | experimental |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
After the compiler has attributed patterns and expressions with type information during type inference, it is straightforward to recompute the type of every pattern and expression. Since all annotated types are monomorphic, there is no need to instantiate any variables or perform any (non-trivial) unifications.