- Cvs-nhc98 - Haskell.org

Fix the hard-coded arity of 'fail' (method of Monad class)
by malcolm＠sparud.net 24 Jan '03

24 Jan '03

malcolm: Fri Jan 24 18:12:33 CET 2003 Update of /usr/src/master/nhc/src/hat/trans In directory hinken:/tmp/cvs-serv20983 Modified Files: TraceId.hs Log Message: Fix the hard-coded arity of 'fail' (method of Monad class).

1 0

Just improve the readability of a type signature.
by malcolm＠sparud.net 24 Jan '03

24 Jan '03

malcolm: Fri Jan 24 14:12:18 CET 2003 Update of /usr/src/master/nhc/src/compiler98 In directory hinken:/tmp/cvs-serv18182/compiler98 Modified Files: MainNew.hs Log Message: Just improve the readability of a type signature.

1 0

Install hat-trans'd library interface files for nhc98 in h
by malcolm＠sparud.net 24 Jan '03

24 Jan '03

malcolm: Fri Jan 24 14:11:10 CET 2003 Update of /usr/src/master/nhc/script In directory hinken:/tmp/cvs-serv18129 Modified Files: confhat Log Message: Install hat-trans'd library interface files for nhc98 in hierarchical dirs.

1 0

Make export list H'98 compliant by removing a spurious com
by malcolm＠sparud.net 24 Jan '03

24 Jan '03

malcolm: Fri Jan 24 11:27:33 CET 2003 Update of /usr/src/master/nhc/src/hat/lib/Hat In directory hinken:/tmp/cvs-serv16422 Modified Files: Hat.hs Log Message: Make export list H'98 compliant by removing a spurious comma.

1 0

Fix an obscure bug with transitive import/export of instan
by malcolm＠sparud.net 22 Jan '03

22 Jan '03

malcolm: Wed Jan 22 17:58:58 CET 2003 Update of /usr/src/master/nhc/src/compiler98 In directory hinken:/tmp/cvs-serv6727 Modified Files: Export.hs Info.hs Log Message: Fix an obscure bug with transitive import/export of instances through several modules. The fault was this: module W: defines class C, instance C T1, exports C module X: imports W, uses class C, does not explicitly export C or T1 module Y: imports X, re-exports X module Z: defines a function that implicitly uses instance C T1 The compiler complained that no such instance exists, even though it does. The interface file for Y was failing to record the instance C T1. Now, the interface file for X /does/ record the instance C T1, even though neither the type nor the class are explicitly exported, and this is correct. However, because the class C is mentioned only `implicitly' (i.e. non-exported) in X's interface, Y did not import C from X, and did not re-export it either, hence deciding that none of its instances were relevant. The fix is to export all the instances attached to an "InfoUsedClass" (i.e. one found in passing in an interface file but not imported) in addition to the instances attached to an "InfoClass" (i.e. classes that are really imported).

1 0

Use the standard sort function instead of our own version.
by nordin＠sparud.net 22 Jan '03

22 Jan '03

nordin: Wed Jan 22 08:07:01 CET 2003 Update of /usr/src/master/nhc/src/compiler98 In directory hinken:/tmp/cvs-serv27558 Modified Files: Case.hs Derive.hs MergeSort.hs PreImport.hs Scc.hs TypeCtx.hs Log Message: Use the standard sort function instead of our own version.

1 0

Argument handling was off by two.
by nordin＠sparud.net 22 Jan '03

22 Jan '03

nordin: Wed Jan 22 01:43:16 CET 2003 Update of /usr/src/master/nhc/src/runtime/Builtin In directory hinken:/tmp/cvs-serv22252/src/runtime/Builtin Modified Files: cGetArgs.c Log Message: Argument handling was off by two.

1 0

Added the application-of-function-of-known-arity optimisat
by olaf＠sparud.net 16 Jan '03

16 Jan '03

olaf: Thu Jan 16 15:31:37 CET 2003 Update of /usr/src/master/nhc/src/hat/trans In directory hinken:/tmp/cvs-serv20926/src/hat/trans Modified Files: AuxFile.hs AuxLabelAST.hs AuxTypes.hs TraceDerive.hs TraceId.hs TraceTrans.hs Log Message: Added the application-of-function-of-known-arity optimisation to Hat. If a function of known arity n is applied to n arguments, then instead of the apn/uapn combinators the new appn/uappn combinators are used (0 < n <= 5). If function and application are trusted, then even only a uWrapForward combinator is used. All these combinators do not use the wrapper of a function, but directly the worker. Thus time for some wrapping and unwrapping is saved. With optimisation the same *.hat file is produced as without. A speedup of 15-20% was measured for adjoxo edgecorner1.in and mate ellerman. A hack is used to avoid ambiguous type variables in the transformed program: a type declaration of a function is transformed into type declarations for the wrapper function. There are no type declarations for worker functions, type inference might yield a rather general type and then direct use of a worker by the new combinators may yield to an ambiguous type variable error. Constructing a type declaration for a worker would be hard; in general it would be necessary to expand type synonyms. Hence the transformation adds a bogus last equation to the worker definition (because of "| False =" it can never be taken) which contains a call of the wrapper. Thus the worker inherits the type of its wrapper. A worker definition used to be local to its wrapper definition. Because workers may now be called directly, they are now defined in the same scope. The exceptions are class/instance methods, because no additional definitions are allowed there. However, workers of methods are never directly called anyway, because methods do not have a fixed arity. Corrected that the arity of the predefined function composition (.) had wrongly been set to 2 instead of 3.

1 0

Added the application-of-function-of-known-arity optimisat
by olaf＠sparud.net 16 Jan '03

16 Jan '03

olaf: Thu Jan 16 15:31:35 CET 2003 Update of /usr/src/master/nhc/src/hat/lib/Hat In directory hinken:/tmp/cvs-serv20926/src/hat/lib/Hat Modified Files: Hat.hs Log Message: Added the application-of-function-of-known-arity optimisation to Hat. If a function of known arity n is applied to n arguments, then instead of the apn/uapn combinators the new appn/uappn combinators are used (0 < n <= 5). If function and application are trusted, then even only a uWrapForward combinator is used. All these combinators do not use the wrapper of a function, but directly the worker. Thus time for some wrapping and unwrapping is saved. With optimisation the same *.hat file is produced as without. A speedup of 15-20% was measured for adjoxo edgecorner1.in and mate ellerman. A hack is used to avoid ambiguous type variables in the transformed program: a type declaration of a function is transformed into type declarations for the wrapper function. There are no type declarations for worker functions, type inference might yield a rather general type and then direct use of a worker by the new combinators may yield to an ambiguous type variable error. Constructing a type declaration for a worker would be hard; in general it would be necessary to expand type synonyms. Hence the transformation adds a bogus last equation to the worker definition (because of "| False =" it can never be taken) which contains a call of the wrapper. Thus the worker inherits the type of its wrapper. A worker definition used to be local to its wrapper definition. Because workers may now be called directly, they are now defined in the same scope. The exceptions are class/instance methods, because no additional definitions are allowed there. However, workers of methods are never directly called anyway, because methods do not have a fixed arity. Corrected that the arity of the predefined function composition (.) had wrongly been set to 2 instead of 3.

1 0

Added the application-of-function-of-known-arity optimisat
by olaf＠sparud.net 16 Jan '03

16 Jan '03

olaf: Thu Jan 16 15:31:35 CET 2003 Update of /usr/src/master/nhc/src/hat/lib In directory hinken:/tmp/cvs-serv20926/src/hat/lib Modified Files: PreludeBuiltinTypes.hx Log Message: Added the application-of-function-of-known-arity optimisation to Hat. If a function of known arity n is applied to n arguments, then instead of the apn/uapn combinators the new appn/uappn combinators are used (0 < n <= 5). If function and application are trusted, then even only a uWrapForward combinator is used. All these combinators do not use the wrapper of a function, but directly the worker. Thus time for some wrapping and unwrapping is saved. With optimisation the same *.hat file is produced as without. A speedup of 15-20% was measured for adjoxo edgecorner1.in and mate ellerman. A hack is used to avoid ambiguous type variables in the transformed program: a type declaration of a function is transformed into type declarations for the wrapper function. There are no type declarations for worker functions, type inference might yield a rather general type and then direct use of a worker by the new combinators may yield to an ambiguous type variable error. Constructing a type declaration for a worker would be hard; in general it would be necessary to expand type synonyms. Hence the transformation adds a bogus last equation to the worker definition (because of "| False =" it can never be taken) which contains a call of the wrapper. Thus the worker inherits the type of its wrapper. A worker definition used to be local to its wrapper definition. Because workers may now be called directly, they are now defined in the same scope. The exceptions are class/instance methods, because no additional definitions are allowed there. However, workers of methods are never directly called anyway, because methods do not have a fixed arity. Corrected that the arity of the predefined function composition (.) had wrongly been set to 2 instead of 3.

1 0