- Cvs-nhc98 - Haskell.org

patch applied (hat): Add a tracing version of the library Data.PackedString.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Apr 3 06:40:31 PST 2003 malcolm * Add a tracing version of the library Data.PackedString. A ./src/hatlib/Data/PackedString.hs A ./src/hatlib/Data/PackedStringBuiltin.hx A ./src/hatlib/Hat/Data/PackedStringBuiltin.hs M ./src/hatlib/Makefile -2 +3

1 0

patch applied (hat): Correct bug in expansion of type synonyms for worker type signatures.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Apr 2 08:21:52 PST 2003 olaf * Correct bug in expansion of type synonyms for worker type signatures. Malcolm's following program failed transforming: ----A.hs---- module A where type State d s u s' = d -> s -> (u,s') ----B.hs---- module B where import A data Down = Down data Thread = Thread type GcodeFixMonad a = State Down Thread a Thread checkIfR :: Int -> GcodeFixMonad Bool checkIfR i Down Thread = (i==0, Thread) ----end---- $ hmake -hat B.hs hat-trans A.hs Creating directories Hat Wrote Hat/A.hs nhc98 -c -package hat -o Hat/A.o Hat/A.hs hat-trans B.hs Fail: expandTypeSynonym: GcodeFixMonad___1 is not a type synonym The problem was that when determining the upper part of a rhs of a type synonym definition that may be expanded, it may (and in this example is) necessary to expand a type synonym occuring on the rhs. Modifying hat-trans to perform correct expansion showed up two bad design properties of its implementation: 1. The upper part of the rhs of a type synonym needs to be written in the .aux file and the helper type synonyms for the lower parts of the rhs need to be added to the transformed program. Upper and lower parts are in a natural way determined by a single splitSynonym function. However, the generation of the environment that is later written to the .aux file and the generation of the transformed program happen in two separate passes, working on different data structures (e.g. TokenId vs TraceId). Hence the code of splitSynonym is basically duplicated, and both variants have to agree to make everything work. Is there an architecture that avoids this duplication? 2. Originally, when generating the upper part of a rhs for the .aux file, the information about the (upper part of) rhss of other type synonyms was not available. The passes were: 1 Traverse top level ast to determine identifier map 2 Traverse top level ast to determine environment of locally defined exported identifiers. 3 Read imports to determine environment of all exported identifiers. 4 Write environment of all exported identifiers into aux file. 5 Traverse top level ast to determine identifier map 6 Traverse top level ast to determine environment of all locally defined identifiers. 7 Read imports to determine environment of all possibly used identifiers. 8 Traverse whole ast to annotate it with infos from environment. Because the environment generated by step 7 is needed for type synonym splitting in step 2 and 6, I rearranged the passes: 1 Traverse top level ast to determine identifier map 2 Read imports to determine environment of all imported possibly used identifiers. 3 Traverse top level ast to determine environment of all used identifiers. 4 Traverse whole ast to annotate it with infos from environment. 5 Traverse top level ast to determine identifier map 6 Traverse top level ast to determine environment of locally defined exported identifiers. 7 Read imports to determine environment of all exported identifiers. 8 Write environment of all exported identifiers into aux file. So now the environment for type splitting is generated in step 3 and used in steps 3 and 6. To enable generation and use in step 3 essential use of lazy evaluation is made in step 3. As long as there is no cyclic type synonym definition this does not cause a black hole. The rearrangement has the disadvantage that orginal and attributed ast live at the same time. It works, but certainly all this could be much simpler and more efficient? M ./src/hattrans/AuxFile.hs -28 +77 M ./src/hattrans/AuxLabelAST.hs -28 +16 M ./src/hattrans/AuxTypes.hs +16 M ./src/hattrans/Flags.hs +3 M ./src/hattrans/HatTrans.hs -7 +13 M ./src/hattrans/Makefile -1 +1 M ./src/hattrans/TraceId.hs +5 M ./src/hattrans/TraceTrans.hs -9 +13

1 0

patch applied (hat): Remove another bug in type checker with respect to type synonyms.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Tue Apr 1 05:54:36 PST 2003 olaf * Remove another bug in type checker with respect to type synonyms. The program below did not type check (occurrence check failure), because the type checker did not expand type synonyms before doing the occurrence check. Expansion of a type can lead to a type with less type variables, or in this case the type to be substituted is just a simple type variable. In turned out that for the latter handling of type class contexts it is important that a substitution never replaces a variable by a type that is not a type variable but becomes a type variable after type synonym expansion. So unification assures that the resulting substitution meets this constraint. There may still be further errors with respect to unexpanded type synonyms in nhc98. Simply exanding all first would avoid all the problems, but also lead to less readable type error messages. -- begin import List ( nub ) type GNode a = a type GNodes a = [ GNode a ] type GEdge a = ( GNode a , GNode a ) type GEdges a = [ GEdge a ] -- Find edges that contain occurrences of nodes not given in arg2. unknownNodesInEdges :: (Eq a) => GEdges a -> GNodes a -> GEdges a unknownNodesInEdges edges nodes = nub (filter (notNode . fst) edges ++ filter (notNode . snd) edges) where notNode = \x -> notElem x nodes M ./src/compiler98/NT.hs -1 +7 M ./src/compiler98/TypeUnify.hs -26 +36

1 0

patch applied (hat): An announcement for hat-2.02.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Mar 26 10:57:49 PST 2003 malcolm * An announcement for hat-2.02. A ./ANNOUNCE

1 0

patch applied (hat): Bump hat version number to 2.02.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Mar 26 08:57:06 PST 2003 malcolm * Bump hat version number to 2.02. M ./Makefile.inc -2 +2

1 0

patch applied (hat): The file script/pkgdirlist is required in the src distribution.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Mar 26 08:56:48 PST 2003 malcolm * The file script/pkgdirlist is required in the src distribution. M ./Makefile -1 +2

1 0

patch applied (hat): Update documentation ready for hat-2.02 release.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Mar 26 08:53:14 PST 2003 malcolm * Update documentation ready for hat-2.02 release. R ./docs/browser-detail.html R ./docs/bugs-tools.html M ./docs/bugs.html -36 +6 M ./docs/config.html +2 M ./docs/copyright.html -3 +5 M ./docs/cvs.html -27 +50 M ./docs/download.html -6 +6 M ./docs/faq.html +2 M ./docs/index.html -3 +5 M ./docs/install.html -13 +9 M ./docs/libraries.html -1 +3 R ./docs/limitations-detail.html R ./docs/limitations.html M ./docs/maillist.html -1 +3 M ./docs/publications.html -6 +9 M ./docs/requirements.html -15 +29 M ./docs/status.html -4 +7 M ./docs/todo.html -125 +90

1 0

patch applied (hat): Remove assumption that ghcsym is always filled in.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Mon Mar 17 06:27:55 PST 2003 malcolm * Remove assumption that ghcsym is always filled in. M ./configure -1 +1 M ./script/confhc-hat -3 +5

1 0

patch applied (hat): Give an explicit instance Show for the Safety property of foreign imports,
by Malcolm Wallace 10 Oct '06

10 Oct '06

Mon Mar 17 04:07:26 PST 2003 malcolm * Give an explicit instance Show for the Safety property of foreign imports, because it is used for output from hat-trans. The auto-derived instance is not legal Haskell. M ./src/compiler98/Syntax.hs -1 +6

1 0

patch applied (hat): This documentation seems to have been omitted from the repository
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Mar 13 05:15:04 PST 2003 malcolm * This documentation seems to have been omitted from the repository for some time. A ./docs/todo.html

1 0