summaryrefslogtreecommitdiff
path: root/compiler/codeGen/CgExtCode.hs
diff options
context:
space:
mode:
authorsimonpj@microsoft.com <unknown>2010-10-08 13:37:51 +0000
committersimonpj@microsoft.com <unknown>2010-10-08 13:37:51 +0000
commitdebb7b80e707c343a3a7d8993ffab19b83e5c52b (patch)
tree77a59444eaf39fa2bd3220fe12074a6ee737ee80 /compiler/codeGen/CgExtCode.hs
parentcd2f5397bc1345fc37706168c268a8bd37af7f2f (diff)
downloadhaskell-debb7b80e707c343a3a7d8993ffab19b83e5c52b.tar.gz
Beautiful new approach to the skolem-escape check and untouchable
Instead of keeping a *set* of untouchable variables in each implication contraints, we keep a *range* of uniques for the *touchable* variables of an implication. This are precisely the ones we would call the "existentials" if we were French. It turns out that the code is more efficient, and vastly easier to get right, than the set-based approach. Fixes Trac #4355 among others
Diffstat (limited to 'compiler/codeGen/CgExtCode.hs')
0 files changed, 0 insertions, 0 deletions