Alejandro Serrano
Alejandro Serrano
I had a discussion with @lucaspena, and the problem seems more complex that it appears at first, since there are a lot of traps which would make `f e1 e2`...
With #115 this should be the case: the `Data.Foldable.find` should stop once the first one is found.
The `State` part threads two pieces of information: - the current known facts, - the statistics about found constructors, and so on. Those two things always "grow", and in a...
I've been talking with @lucaspena about how to change the weighted list into a `Tree`.
In fact, I think that we can more or less easily use the following monad: ```haskell data Tree lang a = Leaf a | Node (Maybe (TermMeta lang SymVar)) [Tree...
Current progress: - [X] @0xd34df00d turned the two layers of `ReaderT` into a single on (#116) - [X] @serras has introduced a new `TreeT` monad (#115)
Unfortunately this is not possible, as this plug-in uses the Kotlin analysis tools underneath :(
This would also work for [`Map`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map)
We should also check that `values` works for all these. Otherwise, it should be as easy as changing the getter in `values` to `[...obj.values()]`, so it works everywhere an iterator...
Thanks for your work on making the DSL better, @kyay10. I really like everything which removes constraints from our DSLs, so if we can have `suspend` and non-`suspend` functions when...