top | item 44339410 (no title) duve02 | 8 months ago > You could write this same proof in absolutely any language that supports recursionWell, you at least need dependent types just to state the theorem, which eliminates nearly all other languages. discuss order hn newest No comments yet.
No comments yet.