A function expression is syntactic sugar for a let and an anonymous function expression.
This is obviously false for recursive functions. So I add "for non-recursive case" to the doc. Still, it is awkward as readers might wonder how recursive functions get desugared. Also, fun in fact always gets desugared to a variable assignment, so it's technically inaccurate too.
The doc previously said:
This is obviously false for recursive functions. So I add "for non-recursive case" to the doc. Still, it is awkward as readers might wonder how recursive functions get desugared. Also,
funin fact always gets desugared to a variable assignment, so it's technically inaccurate too.