Last night, the phrase "strictness in kinds" just stuck in my head. I could have sworn I'd heard it or read it before. But after some googling, I couldn't find anything on it. So, I started think about what it would look like for GHC to track strictness in the kind of an expression. It's kind of like proposals B2 and B3 from https://gitlab.haskell.org/ghc/ghc/wikis/unlifted-data-types, but I thought I'd share it here.