Hi,
Would it be possible to implement a Map in Haskell that, when
asked for a key it doesn't have, would return a 'fresh'
(meaning: not in the Map already) value, and afterwards it
would consistently return the same value for the given key.
In other words, it would behave like a dynamic map
When I am trying to build GHC from CVS it fails with:
deSugar/DsMeta.hs:288:13:
Constructor `ConDecl' should have 6 arguments, but has been given 4
When checking the pattern: ConDecl con [] (L _ []) details
When checking the pattern: L loc (ConDecl con [] (L _ []) details)
In the
