-
Hello, I'm exploring what I can or can't do with higher-order functions. Is there a straightforward way to get the following failing example to typecheck?
It seems that defining a higher-order func…
-
SAW could be more informative in its error message here. With these definitions
let {{
twice: ([8] -> [8]) -> [8] -> [8]
twice f x = f (f x)
add1: [8] -> [8]
add1…
-
## plot predicted time series
t_pred = np.linspace(0, 365*6, 2000)
# get best-fit in CARMA space
best_fit_kernel = DRW_term(*np.log(best_fit))
best_fit_arma = best_fit_kernel.get_carma_parameter…
-
### What is the problem
In trying to migrate an eXist app currently running on eXist 3.3 to current 4.7 I hit a strange NPE. The actual code is scattered across several modules and functions but I …
-
-
**Is your feature request related to a problem? Please describe.**
Regarding rescript support, we discuss about highlighting `@function` (https://github.com/nkrkv/tree-sitter-rescript/issues/1). On…
-
NativeScript supports marshalling Java bytecode generated by Kotlin. But Kotlin has a way to specify that a function takes another function in a much better way than Java.
Like this:
```kotlin
…
-
The translator works on recursive functions that recurse as an argument to `MAP` (and maybe some other simple functions), but in general recursion as an argument to a higher-order function makes the t…
-
Given an input like
```rust
let foo = vec![1, 2, 3].iter().map(make_foo);
```
where `make_foo` doesn't resolve, it would be nice if RA offered to generate an `fn make_foo(arg0: i32) -> _`.
-
Today, the `purry` function that's exported from this library behaves more like an internal wrapper function. It's untyped and requires a developer to contain it inside of a wrapper function with type…