-
Vavr already supports non-concurrent function memoization. As I happen to have written a concurrent recursive function memoizer some time ago, I will attach it as a patch for you to decide if it's wor…
-
Given a value `x`, is there a way to get the result of `Eval native_compute in x` together with a proof that this result is equal to `x`, without needing to run the native compiler twice?
In the c…
-
In general, benchmarks in isolation aren't very useful. To compare benchmarks we need an external tool (like `benchstat`). It'd be nice if we could do comparative benchmarking from within the go tes…
-
GLSL currently does not support tail recursion, but this feature could be easily implemented using tail-call optimization. For example, this function is not yet compatible with GLSL:
```
int fib(i…
-
### Discussed in https://github.com/lampepfl/dotty/discussions/18516
Originally posted by **MaYosy** September 5, 2023
compile failed:
```scala
@main def main(n: Int) = (time compose fib(_)…
-
Everyone's favorite fibonacci example:
```
function fib(n)
n < 2 && return n
n |> Map(n -> fib(n-1) + fib(n-2)) |> first
end
```
Here, the result of `first` infers to `Any`. This basica…
-
idk why, but when i go save in the nearest place possible (like how you would save your respawn at the door in ore chasm in order to farm the Fibber quickly), it just takes me back to the nearest FT s…
-
I cloned the repo and then created a virtual environment and installed requirements.txt.
Now I moved into `examples` directory and tried running `fib.py` . Got this error.
```
Traceback (most r…
-
For Example, recursion of Fib(10^6) is delayed computation so your stack need 10^6 space.
But if you use Dynamic Programming you only need some temp variables or store variables into list.
Then do F…
-
## readme
有觀察到版本號會包含很多小版本,很好。
## sum
作業要求是以 array 函式來完成 sum,你選擇用 reduce,而不是其他 array 函式,為什麼?有研究過其他 array 函式嗎?為什麼不是選其他的?
## Fib
你提供了兩種作法,本質上都是遞回,但第二種有用到 closure,請你分析一下第二種作法跟第一種作法的差異,有什麼優缺點?
…