-
"the hypotheses imply that $\pi_k(fib_f {f(a)})=0$ for all $k\le n$ and $a:A$, and that $||{fib_f{f(a)}}||_0$ is contractible.
Since $\pi_k(fib_f {f(a)}) = \pi_k(||{fib_f{f(a)}}||_n)$ for $k\le n$,…
-
Sometimes we need custom functions to write hugo templates easier.
Here is my ideal example.
```
{{ func "subs" "s" "map" }}
{{ $s := .s }}
{{ range $key, $index := .map }}
{…
-
Web assembly is already available ( behind flag ) in node 6, so might worth trying it as a next level of ["Userspace JIT" approach](https://github.com/sidorares/node-mysql2/blob/c487f542f7f4416f975931…
-
In `haskell-indent`, it also completes the function name.
Suppose following situation:
``` haskell
fib :: Int -> Int
fib 0 = 1
-- ^ cursor here
```
When I hit `C-j` and `TAB` twice, `haskell…
-
**Makefile:**
all:
C:\mercury-14.01-vs2013\bin\merc.BAT --make libhello_world
**Source file... hello_world.m:**
:- module hello_world.
:- interface.
:- import_module int.
:- pred fib(int::in, …
-
## readme
ok,npm 這邊可以再試著深入一點研究看看。
## sum
- 第一個 sum 有對輸入的值做檢查,非常好。
- 這邊你總共用了 reduce, forEach, map, eval + join,都是你自己想的嗎?那有哪個必較恰當?哪個比較不恰當嗎?
## Fib
這邊你用了遞迴的寫法,還有其他種寫法嗎?差別是什麼?
## Stack
…
azole updated
2 weeks ago
-
I always want to write something like Haskell in Python
```
with Multimethod() as fib:
fib[1] = 1
fib[2] = 2
fib[int] = lambda n: fib(n-1) + fib(n-2)
```
and this can be done by l…
-
def fib_generator():
a,b=0,1
while True:
yield b
a,b=b,a+b
fib = fib_generator()
for i in range(1,10):
print(next(fib))
-
just using this issue to keep track of my dumb ideas
- imperative implementation in the lambda calculus
- latex macro
- import python's @lru_cache decorator to implement caching for you
- scrape…
-
If I define a simple recursive Fibonacci function and apply `@code_typed`, I can see that Julia unrolled one level of recursion:
```
julia> fib(n) = n @code_typed fib(10)
CodeInfo(
1 ─ %1 = Base…