摘要：
Given a number N, the output should be the all the prime numbers which is less than N. The solution is called Sieve of Eratosthenes: First of all, we 阅读全文
posted @ 2019-05-14 23:09
Zhentiw
阅读(342)
评论(0)
推荐(0)
摘要：
succ :: Doing N + 1 times fn. add :: Doing N times succ, based on K mult :: is B pow :: or Thrush, is flip isZero :: return just T otherwise K(F) , K 阅读全文
posted @ 2019-05-13 04:57
Zhentiw
阅读(198)
评论(0)
推荐(0)
只有注册用户登录后才能阅读该文。 阅读全文
posted @ 2019-05-12 04:55
Zhentiw
阅读(2)
评论(0)
推荐(0)
只有注册用户登录后才能阅读该文。 阅读全文
posted @ 2019-05-12 03:20
Zhentiw
阅读(3)
评论(0)
推荐(0)
摘要：
Private variable in class: class field syntax: Previously you need to call 'super' But now, we don't need to, you can use classs field: Above two feat 阅读全文
posted @ 2019-05-10 22:39
Zhentiw
阅读(294)
评论(0)
推荐(0)
摘要：
125, how to conver to binary number? 阅读全文
posted @ 2019-05-10 21:50
Zhentiw
阅读(265)
评论(0)
推荐(0)
摘要：
Take away from NGCONF talk. It is a good show case to how to use decorator. One take away is that we can use 'symbol' to uqine key. 阅读全文
posted @ 2019-05-10 20:08
Zhentiw
阅读(487)
评论(0)
推荐(0)
摘要：
const log = console.log; // zero :: &fa.a const zero = f => x => x; // zero is F // once :: &fa.fa const once = f => x => f(x); // once it I // twice :: &fa.f(fa) const twice = f => x => f(f(x)); //... 阅读全文
posted @ 2019-05-10 14:34
Zhentiw
阅读(251)
评论(0)
推荐(0)
只有注册用户登录后才能阅读该文。 阅读全文
posted @ 2019-05-09 02:02
Zhentiw
阅读(1)
评论(0)
推荐(0)
只有注册用户登录后才能阅读该文。 阅读全文
posted @ 2019-05-08 00:34
Zhentiw
阅读(2)
评论(0)
推荐(0)
浙公网安备 33010602011771号