diff options
| author | Ben Gamari <ben@smart-cactus.org> | 2016-07-20 19:04:10 +0200 |
|---|---|---|
| committer | Ben Gamari <ben@smart-cactus.org> | 2016-07-20 19:35:33 +0200 |
| commit | 83e4f49577665278fe08fbaafe2239553f3c448e (patch) | |
| tree | 8cb7cbd315261e09d2a78b5f15a64232c628d199 /compiler/prelude/PrelNames.hs | |
| parent | cf989ffe490c146be4ed0fd7e0c00d3ff8fe1453 (diff) | |
| download | haskell-83e4f49577665278fe08fbaafe2239553f3c448e.tar.gz | |
Revert "Clean up interaction between name cache and built-in syntax"
This reverts commit 9513fe6bdeafd35ca1a04e17b5f94732516766aa.
Sadly this broke with -DDEBUG.
Diffstat (limited to 'compiler/prelude/PrelNames.hs')
| -rw-r--r-- | compiler/prelude/PrelNames.hs | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/compiler/prelude/PrelNames.hs b/compiler/prelude/PrelNames.hs index 4d5e378f57..3905afa1bd 100644 --- a/compiler/prelude/PrelNames.hs +++ b/compiler/prelude/PrelNames.hs @@ -87,8 +87,7 @@ This is accomplished through a combination of mechanisms: b) The known infinite families of names are specially serialised by BinIface.putName, with that special treatment detected when we read back to ensure that we get back to the - correct uniques. See Note [Symbol table representation of names] - in BinIface. + correct uniques. Most of the infinite families cannot occur in source code, so mechanisms (a,b) sufficies to ensure that they always have |