Show HN: Dependently typed language for proofs that you can implement in one day
Sorry but you cannot implement this in a day. I&#x27;ve written my own language very similar to this and from my experience it takes way longer. Implementing type checking for just lambdas, pi types, universes, unit, and absurd would take a day or two on it&#x27;s own. Not to mention Sigma types, co-product types, w-types, identity types, natural numbers, and lists. You also have type inference and evaluation. Also the time spent coming to grips with what all of this means. It&#x27;s a really cool project but I expect it would take a week minimum to implement this and have a solid understanding of everything you&#x27;ve done.