Stefan Fehrenbach
Stefan Fehrenbach
Might want to address an issue or two from #12 while doing that (encoding of either, records $dotdot)
Ah, that makes sense. Thanks!
It took some doing, but this generates decent code now: ```PureScript data Test = Test Boolean { a :: Int, b :: Array Number } derive instance eqTest :: Eq...
Mostly me, I dropped the ball.. I have an updated branch locally that derives instances using hashWithSalt and is debitrotted. There's some support code that still needs to be written...
Test substitution in lambda case of typecheck push with known result type: `> test: Pi s : * . s -> s = lambda t : * . lambda x...
Yes, it could be in a separate library. The reason it isn't, is that I really want `Hashable` to be in the prelude and add compiler support for deriving instances,...
I'll consider it if the prelude discussion/decision drags on for too long. In the meantime, is there a reason to not just depend on this library?
There are some in `bench/`. They also run in CI, but for some reason the output doesn't show up in the logs... CI is of course not an ideal environment...
Agreed. I'd be happy to accept a PR that adds one.
In arrays, we start with accumulator 1, so the array length contributes to the array hash even when all elements hash to 0, as @nukisman observed. I made this mistake...