- Cvs-nhc98 - Haskell.org

patch applied (hat): Propagate additional SExp constructor SString into dependent modules.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 17 07:23:58 PDT 2002 malcolm * Propagate additional SExp constructor SString into dependent modules. M ./src/hattools/Pattern.hs +6 M ./src/hattools/TExp.hs +2

1 0

patch applied (hat): hat-observe of `f in f' (i.e. only recursive calls) gave no results.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 17 03:32:32 PDT 2002 malcolm * hat-observe of `f in f' (i.e. only recursive calls) gave no results. M ./src/hattools/observeutils.c -1 +3

1 0

patch applied (hat): When navigating with arrow keys in hat-trail, treat a sugared character
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 17 03:30:33 PDT 2002 malcolm * When navigating with arrow keys in hat-trail, treat a sugared character string as a single unit, rather than moving the selection inside the string. Also, ensure that a sugared list (e.g. [a,b]) always has a terminating square bracket, even when the list is cut off at the standard depth. M ./src/hattools/SExp.hs -52 +41

1 0

patch applied (hat): In hat-trail, on the RHS of an equation, do not stop at the first
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 17 03:26:56 PDT 2002 malcolm * In hat-trail, on the RHS of an equation, do not stop at the first Hidden node if one is encountered, but continue searching. M ./src/hattools/HatTrail.hs -4 +4

1 0

patch applied (hat): The renamer for -hat did not handle the case that a locally defined
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu May 16 09:44:38 PDT 2002 malcolm * The renamer for -hat did not handle the case that a locally defined variable can shadow a field name. M ./src/compiler98/AuxLabelAST.hs -12 +21 M ./src/hattrans/AuxLabelAST.hs -12 +21

1 0

patch applied (hat): (==) should be a valid pattern in hat-observe.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu May 16 04:27:39 PDT 2002 malcolm * (==) should be a valid pattern in hat-observe. M ./src/hattools/Pattern.hs -1 +2

1 0

patch applied (hat): Replaced definition of wrapForward by def. of wrapUForward.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 10 12:11:48 PDT 2002 olaf * Replaced definition of wrapForward by def. of wrapUForward. This combinator is always used in an untraced context. Hence it is unnecessary to have two variants. Actually expected slightly smaller traces and less performance with nhc98, but there seems to be no difference. M ./src/hatlib/Hat.hs -20 +14

1 0

patch applied (hat): Changed combinators for trusting in -hat.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 10 04:19:36 PDT 2002 olaf * Changed combinators for trusting in -hat. The problem with the previous implementation was that the result of the reduction of a trusted function often contained many Hiddens, making the expression rather useless. E.g.: foldr (:) [] "Hi" = ({_} ({_} [])). The cause was that wrapUForward only works if the trace is demanded before the wrapped expression is demanded. However, the uapn combinators required the function value first and sometimes later required the trace of the function. Have changed uapn combinators to never demand the trace of the function. As a result, the result of the reduction of a trusted function is always shown as Hidden, if it is of functional type. However, if it is of an algebraic type, it is shown correctly. To achieve this, the cnn combinators for partially applied constructors had to be modified to record the complete constructor application in the trace, if called from untraced code. Furthermore made the various application combinators less strict in Fun, to avoid potential blackholes. Thought this would avoid blackhole in Clausify program, but unfortunately it does not. Slightly improves performance though. M ./src/hatlib/Hat.hs -199 +319

1 0

patch applied (hat): In Hat combinator library reintroduce stack for entered redexes and use a buffer only for deferred updating of reduced redexes.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Mon May 6 04:31:29 PDT 2002 olaf * In Hat combinator library reintroduce stack for entered redexes and use a buffer only for deferred updating of reduced redexes. The main advantage is that we obtain a good entry point for hat-trail into the trace if the computation was interrupted or aborted with an error that was only caught as an exception in Haskell or on the C-side. The entry point is the last redex that was entered but not yet reduced. The reference of a reduced redex is always compared with the reference on top of the stack to recognise the situation where a Haskell exception renders part of the stack garbage. Then the stack is popped until an entry with the same reference is found. The popped entries (except for the last) are written as Entered into the trace. However, it seems there are never any such entries anyway, because IO-actions always reduce successfully to Abstract "IO". Need good test case. Interruptions often happen at an entered Forward. These do not however have a parent in the trace. Hence the combinator library at least keeps a parent for every Forward on the stack, so that the entry point can be that parent. (Actually unevaluated and entered Forwards should have a parent; but that needs change of trace file format). Stack plus buffer also seems to be slightly more efficient than the previous buffering method. M ./src/hatlib/Hat.hs -3 +4 M ./src/hatlib/hat-c.c -59 +204 M ./src/hatlib/hat-c.h -4 +7 M ./src/hattools/Makefile -4 +4

1 0

patch applied (hat): Quote the function name passed to hat-observe from hat-trail.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri May 3 09:28:21 PDT 2002 malcolm * Quote the function name passed to hat-observe from hat-trail. (To avoid the shell interpreting <= as file redirection etc.!) M ./src/hattools/HatTrail.hs -1 +1

1 0