úÎ!ü²     (C) 2017 Ryan Scott BSD-style (see the file LICENSE) Ryan Scott ExperimentalGHCUnsafe eliminators dataName> generates a top-level elimination function for the datatype dataNameS. The eliminator will follow these naming conventions: The naming conventions are:UIf the datatype has an alphanumeric name, its eliminator will have that name with elim prepended.PIf the datatype has a symbolic name, its eliminator will have that name with ~> prepended. eliminators funName dataName3 generates a top-level elimination function named funName for the datatype dataName. eliminatorsConstruct a type of the form  x given x. eliminatorsConstruct a type of the form p '' ty given p and ty. eliminatorsKGenerate a list of fresh names with a common prefix, and numbered suffixes. eliminatorsLDecompose an applied type into its individual components. For example, this: Either Int Char would be unfolded to this: Either :| [Int, Char] (C) 2017 Ryan Scott BSD-style (see the file LICENSE) Ryan Scott ExperimentalGHC Trustworthy&'+,-CFQSTViH  (C) 2017 Ryan Scott BSD-style (see the file LICENSE) Ryan Scott ExperimentalGHC Trustworthy ,-FQSTVi¦ eliminators Although k is not actually an inductive data type in GHC, we can (crudely) pretend that it is using this eliminator.      eliminators-0.4-inplaceData.Eliminator.THData.EliminatorData.Eliminator.TypeNats deriveElimderiveElimNamedelimBool elimEither elimMaybeelimNat elimNonEmpty elimOrderingelimList elimTuple0 elimTuple2 elimTuple3 elimTuple4 elimTuple5 elimTuple6 elimTuple7singTypeQsingletons-2.4.1-0469664cc6775cc3cba172450b02ffe83b4188bcd056aafa1c23c1885f8fd1b7Data.Singletons.InternalSingpredType newNameList unfoldTypeghc-prim GHC.TypesNat