Thanks for taking the time to write this message! :-) I agree with your opinion that _some_ FP languages make it seem that FP is necessarily complicated, whereas that's not the case. (This is like concluding from Java experience that "statically-typed languages are verbose".)
While I appreciate the "FP-like functionality" that has gone into Nim (for example `let`, immutable function arguments and strict funcs), I have the impression that one feature always seems lacking in programming languages that weren't designed as FP from the start: [persistent data structures](https://en.wikipedia.org/wiki/Persistent_data_structure) . Although such data structures could be added to Nim, most of the standard library would still use `seq` s and mutable hashes, so persistent data structures would always be "second-class citizens."
