Commit f29a3c91 authored by POTTIER Francois's avatar POTTIER Francois


parent fe249682
......@@ -6,13 +6,9 @@
* Consider using two data fields in `node` instead of one,
so as to avoid using a separate `data` record. Benchmark.
* In `ArraysAsImperativeMaps`, do not require keys to be integers;
instead, require a mapping `id` of keys to integers.
* Provide an extensible-vector implementation of `IMPERATIVE_MAPS`.
* Using the last two features, implement a memoized function over
hash-consed trees, where the memoization table involves no hashing.
* Provide an extensible-vector implementation of `IMPERATIVE_MAPS` for
integers? Like `ArraysAsImperativeMaps`, but does not require `n`.
Use `InfiniteArray`.
* Provide an API in the style of Menhir's `FixSolver`, where constraints are
discovered incrementally during a first phase, then the solver is started?
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment