q
q copied to clipboard
:seedling: Programming language focusing on performance and efficiency.
And will tail call elimination be guaranteed? Possibly only guaranteed when a function is indicated to be tail recusrive?
Can I do something like this? ``` increment(a Int) -> Int { return a + 1 } doUnivariateFunctionTwice(f Int -> Int, x Int) { f(f(x)) } ```
From [here](https://github.com/akyoto/q/blob/master/examples/struct/struct.q) we get ``` struct Point { x Int y Int } ``` but what about ``` struct Point { x `a y `a } ``` In other words...
## 📜 Description Firstly, wanted to say thanks and congratulations. Heard about this because I was looking for an assembler to build a language on, and yours seems to be...