- Cvs-nhc98 - Haskell.org

Propagate additional SExp constructor SString into depende
by malcolm＠sparud.net 17 May '02

17 May '02

malcolm: Fri May 17 16:23:58 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv28537 Modified Files: Pattern.hs TExp.hs Log Message: Propagate additional SExp constructor SString into dependent modules.

1 0

hat-observe of `f in f' (i.e. only recursive calls) gave n
by malcolm＠sparud.net 17 May '02

17 May '02

malcolm: Fri May 17 12:32:32 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv27344/src/hat/tools Modified Files: observe.c Log Message: hat-observe of `f in f' (i.e. only recursive calls) gave no results.

1 0

When navigating with arrow keys in hat-trail, treat a suga
by malcolm＠sparud.net 17 May '02

17 May '02

malcolm: Fri May 17 12:30:33 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv27310/src/hat/tools Modified Files: SExp.hs Log Message: 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.

1 0

In hat-trail, on the RHS of an equation, do not stop at th
by malcolm＠sparud.net 17 May '02

17 May '02

malcolm: Fri May 17 12:26:57 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv27287/src/hat/tools Modified Files: HatTrail.hs Log Message: In hat-trail, on the RHS of an equation, do not stop at the first Hidden node if one is encountered, but continue searching.

1 0

Document hmake bugfix for release version 3.04.
by malcolm＠sparud.net 17 May '02

17 May '02

malcolm: Fri May 17 11:57:36 CEST 2002 Update of /usr/src/master/nhc/docs/hmake In directory hinken:/tmp/cvs-serv27090 Modified Files: changes.html index.html Log Message: Document hmake bugfix for release version 3.04.

1 0

The renamer for -hat did not handle the case that a locall
by malcolm＠sparud.net 16 May '02

16 May '02

malcolm: Thu May 16 18:44:38 CEST 2002 Update of /usr/src/master/nhc/src/compiler98 In directory hinken:/tmp/cvs-serv21175 Modified Files: AuxLabelAST.hs Log Message: The renamer for -hat did not handle the case that a locally defined variable can shadow a field name.

1 0

No log message
by malcolm＠sparud.net 16 May '02

16 May '02

malcolm: Thu May 16 13:27:39 CEST 2002 Update of /usr/src/master/nhc/src/hat/tools In directory hinken:/tmp/cvs-serv19064 Modified Files: Pattern.hs Log Message: (==) should be a valid pattern in hat-observe.

1 0

Replaced definition of wrapForward by def. of wrapUForward
by olaf＠sparud.net 11 May '02

11 May '02

olaf: Fri May 10 21:11:49 CEST 2002 Update of /usr/src/master/nhc/src/hat/lib In directory hinken:/tmp/cvs-serv17868 Modified Files: Hat.hs Log Message: 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.

1 0

Changed combinators for trusting in -hat.
by olaf＠sparud.net 10 May '02

10 May '02

olaf: Fri May 10 13:19:37 CEST 2002 Update of /usr/src/master/nhc/src/hat/lib In directory hinken:/tmp/cvs-serv15568/src/hat/lib Modified Files: Hat.hs Log Message: 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.

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: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