compiler/prelude

Contents:

• compiler/prelude/KnownUniques.hs
  • Note [Uniques for tuple type and data constructors]
• compiler/prelude/PrelInfo.hs
  • Note [About wired-in things]
• compiler/prelude/PrelNames.hs
  • Note [Known-key names]
  • Note [Infinite families of known-key names]
  • Note [The integer library]
• compiler/prelude/PrelRules.hs
  • Note [Constant folding]
  • Note [Rules for floating-point comparisons]
  • Note [The litEq rule: converting equality to case]
  • Note [Guarding against silly shifts]
  • Note [Strength reduction]
  • Note [What’s true and false]
  • Note [tagToEnum#]
  • Note [dataToTag# magic]
  • Note [seq# magic]
  • Note [Scoping for Builtin rules]
  • Note [Rewriting bitInteger]
  • Note [caseRules for tagToEnum]
  • Note [caseRules for dataToTag]
  • Note [Unreachable caseRules alternatives]
• compiler/prelude/PrimOp.hs
  • Note [PrimOp can_fail and has_side_effects]
  • Note [Transformations affected by can_fail and has_side_effects]
  • Note [Implementation: how can_fail/has_side_effects affect transformations]
  • Note [primOpIsCheap]
• compiler/prelude/TysPrim.hs
  • Note [TYPE and RuntimeRep]
  • Note [PrimRep and kindPrimRep]
  • Note [The equality types story]
  • Note [The State# TyCon]
• compiler/prelude/TysWiredIn.hs
  • Note [Wiring in RuntimeRep]
  • Note [Any types]
  • Note [One-tuples]
  • Note [Boxing primitive types]