[commit: ghc] master: Cite the TrieMap idea [skip-ci] (f6609b0)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/ghc

On branch  : master
Link       : http://ghc.haskell.org/trac/ghc/changeset/f6609b0ed031135b8402fd179b3370958698ecb2/ghc

>---------------------------------------------------------------

commit f6609b0ed031135b8402fd179b3370958698ecb2
Author: Edward Z. Yang <ezyang at cs.stanford.edu>
Date:   Mon Mar 2 14:54:30 2015 -0800

    Cite the TrieMap idea [skip-ci]
    
    Signed-off-by: Edward Z. Yang <ezyang at cs.stanford.edu>


>---------------------------------------------------------------

f6609b0ed031135b8402fd179b3370958698ecb2
 compiler/coreSyn/TrieMap.hs | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/compiler/coreSyn/TrieMap.hs b/compiler/coreSyn/TrieMap.hs
index 96db166..dad00e1 100644
--- a/compiler/coreSyn/TrieMap.hs
+++ b/compiler/coreSyn/TrieMap.hs
@@ -47,6 +47,12 @@ The code is very regular and boilerplate-like, but there is
 some neat handling of *binders*.  In effect they are deBruijn
 numbered on the fly.
 
+The regular pattern for handling TrieMaps on data structures was first
+described (to my knowledge) in Connelly and Morris's 1995 paper "A
+generalization of the Trie Data Structure"; there is also an accessible
+description of the idea in Okasaki's book "Purely Functional Data
+Structures", Section 10.3.2
+
 ************************************************************************
 *                                                                      *
                    The TrieMap class