Skip to content
  • Simon Peyton Jones's avatar
    Refactor and improve the promotion inference · 09ff0e0d
    Simon Peyton Jones authored
    It should be the case that either an entire mutually recursive
    group of data type declarations can be promoted, or none of them.
    It's really odd to promote some data constructors of a type but
    not others. Eg
      data T a = T1 a | T2 Int
    Here T1 is sort-of-promotable but T2 isn't (becuase Int isn't
    promotable).
    
    This patch makes it all-or-nothing. At the same time I've made
    the TyCon point to its promoted cousin (via the tcPromoted field
    of an AlgTyCon), as well as vice versa (via the ty_con field of
    PromotedTyCon).
    
    The inference for the group is done in TcTyDecls, the same place
    that infers which data types are recursive, another global question.
    09ff0e0d