This has me piqued. How do you do recursion without tail call optimization? As far as I know, Go compiler doesn't do tail call optimization. The heart of FP lies in the composability of function. Go supports higher order function, so you can compose functions albeit in a limited way. Without generics and function currying, however, it far from what the real FP can do. In addition, FP compiler is a sophisticated compiler with aggressive optimization whereas Go compiler is a WYSIWYG compiler with micro optimization. Even if you can emulate FP in Go, the resulting performance will be worse than if you would use a real FP language. So I don't think it is practical to do an actual FP in Go.
-- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
