1. 19
  1.  

  2. 3

    This is troll software for sure (in the best possible sense of the term!). But it’s also genuinely neat to be viscerally aware of what it is like to encode spellchecking as a static analysis problem. And this is relevant to more practical issues in type-level programming.

    1. 1

      Excellent! As soon as I saw the PR for template literal types, I knew crazy stuff like this would emerge.

      • I wonder if this example can be modified to search through a trie instead of a union of words?
      • I wonder if it’s possible to build a compile-time context-free-grammar to implement a basic grammar-checker?
      1. 1

        Awesome 😎