Jean-Christophe Filliatre

It looks to me that `unsafe_manual_blit` could be slightly more efficient by making use of `Array.unsage_get` and `Array.unsafe_set`.

Stdlib priority queues

33

Hi OCaml developers, Now that we have dynamic arrays in the standard library, it makes sense to derive an implementation of mutable priority queues from that and I think it...

many one-player games can be seen as graphs, and then can be solved using graph traversal algorithms such as DFS, BFS, etc.

**Please verify that the error is present in the most recent revision before reporting.** Done **Chapter number or note title:** 2 Backtracking / 3 Dynamic Programming **Page number:** 96, 144,...

Nested comments are accepted in Koka source code, but then are copied verbatim in C source code, resulting in errors after the first closing `*/`. For instance, this Koka source...

runtime: suggestion for a more efficient implementation of sequences

1

Hi all, The current implementation of sequences in the runtime of `ortac` is using lists, resulting in poor performances for operations such as `get` for instance. See https://github.com/ocaml-gospel/ortac/blob/240b5795041dbb93eb0049e831f2342094c0ff40/src/runtime/ortac_runtime.ml#L191 I'd like...

unboxing a single constructor

3

Dear OCaml developers, I'd like to suggest a new variant of `[@unboxed]` to unbox a single constructor when 1. there are only boxed constructors, 2. the target constructor for unboxing...

Hello, The following code does not type check: ``` var lst = empty lst := link(1, lst) print(1 + lst.first) ``` It complains that `lst` has type `(List