Lukasz Stafiniak
Lukasz Stafiniak
In the initial implementation of virtual nodes, we require that the getters split into two classes: "recursive" ones share all indices with a setter, and regular caller ones are in...
This means: adding indices and multiplying by a constant (stride).
Currently, we only have a `Standard_uniform` initialization, no way of having per-step randomness.
Also, generate the documentation and integrate it with the GitHub page, maybe using `github.io`.
Although MetaOCaml theory does not allow code inspection, it does expose the AST, and we can reimplement `Runnative` and/or rely on offshoring.
To properly support local bindings, we need to collect the type environment. Add the syntactically inferred types with the identifiers on `let` introduction, and look them up for identifiers when...
Even the ones generated from the corresponding `Network.t` suspensions. But initially enough if just for `Nullary` (not suspended).
Basically, standalone `forward` code plus deserializing nodes.
...to lower the actual or perceived maintenance burden.