Chapel supports recursive function calls, but does it support tail call optimisation so that tail recursion does not use an extra stack frame?
I'm reasonably certain that the Chapel compiler does not implement tail recursion optimizations itself. Depending on the complexity of the function, it may be that the back-end compiler (C compiler or LLVM) would perform such optimizations on the generated code.
[Edit: This characterization is for versions 1.14 and earlier of the Chapel compiler]
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With