You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Loved the in-depth coverage and explanations of this series . And it's easy to understand for newcomers who are fresh to FP.
In Continuation Passing Style (CPS) of Chapter 8, it is said that Fibonacci recursion cannot practically be refactored to pure PTC. It confuses me there. As I find below code, though it lost some readability.
function fib(x, res = 1, pre = 1) { if (x <= 1) return res; return fib(x - 1, pre, pre + res) }
Is above fib a pure PTC form?
Any Comments are welcome and appreciated.
The text was updated successfully, but these errors were encountered:
mulongjiangliu
changed the title
Chapter 9: Fibonacci to PTC form?
Chapter 8: Fibonacci to PTC form?
Nov 17, 2018
Loved the in-depth coverage and explanations of this series . And it's easy to understand for newcomers who are fresh to FP.
In Continuation Passing Style (CPS) of Chapter 8, it is said that Fibonacci recursion cannot practically be refactored to pure PTC. It confuses me there. As I find below code, though it lost some readability.
function fib(x, res = 1, pre = 1) { if (x <= 1) return res; return fib(x - 1, pre, pre + res) }
Is above fib a pure PTC form?
Any Comments are welcome and appreciated.
The text was updated successfully, but these errors were encountered: