The old list-based implementation was tuned for Morte and more efficient for type-checking typical Morte expressions (such as Church-encoded bytes), that had multiple occurrences of the same key. I'm still not sure why it was more efficient, though, but it may have been due to better use of laziness. However, these sorts of expressions are rare in idiomatic Dhall code, so we use the more direct approach using a `Map` for faster lookup of the outer keys and a `Seq` for faster indexing into the elements associated with a given key. |
||
---|---|---|
exec | ||
src | ||
dhall.cabal | ||
LICENSE | ||
Setup.hs | ||
stack.yaml |