A complete Wordle game evaluated entirely in the type checker: daily word lookup, per-tile green/yellow/gray scoring, validation, and win/lose screens, all rendered as an ASCII board.
Open experimentDecides whether any anagram of a word can form a palindrome (an "anadrome") by checking character parity, then enumerates every possible palindrome through type-level permutations.
Open experimentGreedy left-to-right candy crushing on a 1D board. Sequences of 3+ like items collapse via recursive conditional inference, with every reduction step traced.
Open experimentSolves LeetCode's Valid Parentheses entirely in the type system: characters are streamed off a template-literal string while a tuple acts as a stack, pushing openers and matching closers to decide VALID 👍 or INVALID 👎.
Open experimentSolves LeetCode's Two Sum in the type system: each number is streamed off a tuple while a record of seen values acts as the hash map, looking up Target − current via tuple-length subtraction and accumulating every matching pair.
Open experiment