May 2002 - Cvs-nhc98 - Haskell.org

In Hat combinator library reintroduce stack for entered re
by olaf＠sparud.net 06 May '02

06 May '02

olaf: Mon May 6 13:31:30 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv6239/src/hat/tools Modified Files: Makefile Log Message: 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.

1 0

In Hat combinator library reintroduce stack for entered re
by olaf＠sparud.net 06 May '02

06 May '02

olaf: Mon May 6 13:31:29 CEST 2002 Update of /usr/src/master/nhc/src/hat/lib In directory hinken:/tmp/cvs-serv6239/src/hat/lib Modified Files: Hat.hs hat.c hat.h Log Message: 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.

1 0

In Hat combinator library reintroduce stack for entered re
by olaf＠sparud.net 06 May '02

06 May '02

olaf: Mon May 6 13:31:28 CEST 2002 Update of /usr/src/master/nhc In directory hinken:/tmp/cvs-serv6239 Modified Files: Makefile Log Message: 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.

1 0

Quote the function name passed to hat-observe from hat-tra
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 18:28:22 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv9285 Modified Files: HatTrail.hs Log Message: Quote the function name passed to hat-observe from hat-trail. (To avoid the shell interpreting <= as file redirection etc.!)

1 0

Change (f . g) = \x-> f (g x) to (.) f g x = f (g x)
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 17:22:37 CEST 2002 Update of /usr/src/master/nhc/src/hat/lib In directory hinken:/tmp/cvs-serv8911 Modified Files: PreludeBasic.hs Log Message: Change (f . g) = \x-> f (g x) to (.) f g x = f (g x) for nicer traces. (The literal lambda looks ugly.)

1 0

Now obsolete.
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 13:20:24 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv7613 Removed Files: HatExpressionTree.hs HatTrace.gc PrettyLib.hs Log Message: Now obsolete.

1 0

Comment out the over-large display squashing code. Reduce
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 13:11:00 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv7551 Modified Files: HatTrail.hs Log Message: Comment out the over-large display squashing code. Reduce the maximum size of the output pane to 1/4 of full screen, rather than 1/3.

1 0

Fix incorrect pretty-printing indent in hat-observe: the h
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 13:10:01 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv7527 Modified Files: HatObserve.hs SExp.hs Log Message: Fix incorrect pretty-printing indent in hat-observe: the highlighting of the eqn number should be done *after* determining its length.

1 0

In pattern lexing, should accept _ and ' as part of an ide
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 12:43:08 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv7381 Modified Files: Pattern.hs Log Message: In pattern lexing, should accept _ and ' as part of an identifier.

1 0

Fix incorrect (cyclic) display of (non-cyclic) partial str
by malcolm＠sparud.net 03 May '02

03 May '02

malcolm: Fri May 3 12:18:59 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv7237 Modified Files: artutils.c Log Message: Fix incorrect (cyclic) display of (non-cyclic) partial structures, typically lists. If the unevaluated part of the structure is an ExpForward pointer to a Hidden, then we should stop at the next Hidden, not clear the Hidden-detection flag.

1 0