Anonymous
12/23/25(Tue)00:39:18 No.107641076 >>107638916
Thanks anon.
I'll need some way to disambiguate between a function name and parameters, otherwise there's simply not enough information in the parser to tell what's a function name and what's a parameter.
I could try doing something insane like attempting to pattern match until I'm left with a single token in the LHS, but that gets ambiguous and expensive quickly.
With regard to output statements, my language will work differently than most. It doesn't have an explicit execution order. It will have "when" statements that run code when dependencies are satisfied.
tmp =
when true add out 1 2
when out print out
Because of this, explicit output statements don't work well. I could have a return keyword and use "when" to pull values out of "return", but that kind of breaks the code flow in the case of multiple possible return types, which is something I do want.
This lets me do cool stuff with hot reloading and reactive programming. It'll be more like programming excel than C.
>>107640461
I'll want to have dependent types in my language. For example, the language could automatically memoize a recursive fibonacci sequence by defining an overload with the specific input number at runtime, eventually assisted by a bytecode JIT.
So my goal is to have the base language be as minimal as it needs to be in order to be fully expressive and composable, if that makes sense.
