Changes between Version 4 and Version 5 of RankNTypes


Ignore:
Timestamp:
Jan 8, 2006 2:57:33 PM (9 years ago)
Author:
ross@…
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • RankNTypes

    v4 v5  
    2929== References == 
    3030 * [http://www.haskell.org/ghc/docs/latest/html/users_guide/type-extensions.html#universal-quantification Arbitrary-rank polymorphism] in the GHC User's Guide. 
    31  * [http://research.microsoft.com/Users/simonpj/papers/higher-rank/index.htm Practical type inference for arbitrary-rank types], Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich and Mark Shields, July 2005. 
     31 * [http://research.microsoft.com/Users/simonpj/papers/higher-rank/ Practical type inference for arbitrary-rank types], Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich and Mark Shields, July 2005. 
     32 * [http://research.microsoft.com/Users/simonpj/papers/boxy/ Boxy types: type inference for higher-rank types and impredicativity], Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones, November 2005. 
    3233 * [http://www.haskell.org/onlinereport/decls.html#type-semantics Semantics of Types and Classes] in the Haskell 98 Report 
    3334 * PolymorphicComponents would also be allowed higher-rank types 
     
    4041A mixture of bottom-up inference and top-down checking often produces more informative error messages. 
    4142 
    42 For arbitrary-rank types, a particular bidirectional traversal is specified by the type rules (see Fig. 8 on p25 of [http://research.microsoft.com/Users/simonpj/papers/higher-rank/index.htm the paper]), to make use of programmer-supplied annotations. 
     43For arbitrary-rank types, a particular bidirectional traversal is specified by the type rules (see Fig. 8 on p25 of [http://research.microsoft.com/Users/simonpj/papers/higher-rank/ the arbitrary-rank paper]), to make use of programmer-supplied annotations. 
    4344In particular, 
    4445 * functions and expressions with type signatures are checked top-down. 
     
    4748 
    4849The generalization preorder must be recursively defined, with contravariance for `->` types (see Fig. 7 on p22 of 
    49 [http://research.microsoft.com/Users/simonpj/papers/higher-rank/index.htm the paper]). 
     50[http://research.microsoft.com/Users/simonpj/papers/higher-rank/ the arbitrary-rank paper]). 
    5051 
    5152The system has the following properties: