A statically-typed functional language with generics, typeclasses, sum types, pattern-matching, first-class functions, currying, algebraic effects, associated types, good diagnostics, etc.
I think this language looks pretty cool and it'll be informative to see chumsky being used as intended by you, the original author.
However, I'm having trouble learning the language's syntax from the examples. If you have the time, would you be willing to write a brief explanation of the syntax?
I understand that this is a hobby project so I'm not looking for anything fancy, it's just that I'm interested in your thoughts on language design and I'd like to understand it a bit better. If I end writing any programs in tao that actually work, that would be entirely incidental.
If it'd be helpful/interesting to you, I can write an itemized list of things I find confusing with links to the relevant lines of code.
I'm reading your personal web site and seeing all your endeavours with languages and I like your attitude you expressed e.g. in Why didn't you use an existing game engine?.
Have you also already explored concatenative languages in general (your atto seems also concatenative)? If not, I'd suggest taking a look at Quark (there is also an original Ruby implementation in few tens of lines).
And sorry for being off topic - I didn't want to spam you privately ๐.
First of all, this looks great! Congratulations on this awesome project.
I just wanted to ask if there is currently any usable FFI, or one in the plans. I'd love to use tao as an embedded language in my projects. However, I realize this may go against your goals of totality, as FFI functions can perform arbitrary computations.