=>

function cubic(a, b, c) { return x => cube(x) + a * square(x) + b * x + c; }

function cont_frac(n, d, k){ function frac(x){ return x > k ? : 0 ? n(x) / ( d(x) + frac(x+1) ); } return frac(1); } function tan_cf(x, k){ return cont_frac(i => i === 1 ? x : x * x, i => 2i - 1, k ) }

const tolerance = 0.0001; function abs(x){ return x > 0 ? x : -x; } function fixed_point(f, first_guess) { function close_enough(x, y) { return abs(x - y) math_log(1000..

const tolerance = 0.0001; function abs(x){ return x > 0 ? x : -x; } function fixed_point(f, first_guess) { function close_enough(x, y) { return abs(x - y) 1 + 1/x, 1.0);

f(f) -> f(2) -> 2(2) 2는 함수가 아닌 원시값이므로 에러가 발생한다.

function accumulate(combiner, null_value, term, a, next, b){ return a > b ? null_value : combiner(term(a), accumulate(combiner, null_value, term, next(a), next, b)); } function accumulate_(combiner, null_value, term, a, next, b){ function iter(a, result) { return a > b ? result : iter(next(a), combiner(term(a), result)); } return iter(a, null_value); } function sum_a(term, a, next, b){ function ..

function product(term, a, next ,b){ return a > b ? 1 : term(a) * product(term, next(a), next, b); } function product_(term, a, next, b){ function iter(a, result) { return a > b ? result : iter(next(a), result * term(a)); } return iter(a, 1); } function factorial(n){ function term(x){ return x; } return product_(term, 1, next, n); } sum 함수에서 덧셈을 곱셈으로 바꾸고 초기화를 0이 아닌 1로 해주면 된다. function pi(n) { fun..

function next(n) { return n+1; } function sum(term, a, next, b) { function iter(a, result) { return a > b ? result : iter(next(a), result + term(a)); } return iter(a, 0); } Javascirpt의 내장 함수 reduce가 생각나서 금방 해결했다

function times(a, b){ return b === 0 ? 0 : a + times(a,b - 1); } function double(n){ return n + n; } function halve(n){ return n / 2; } function fast_times(a, b){ return b === 0 ? 0 : is_even(b) ? fast_times(double(a), halve(b)) : a + times(a ,b - 1); } function is_even(n) { return n % 2 === 0; }

function fast_expt(b, n) { return fast_expt_iter(b, n, 1); } function fast_expt_iter(b, counter, product) { return counter === 0 ? product : is_even(counter) ? fast_expt_iter(b * b, counter/2, product) : fast_expt_iter(b, counter-1, b* product); } function sqaure(n) { return n * n; } function is_even(n) { return n % 2 === 0; }