Bugs item #686622, was opened at 2003-02-14 16:35
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=686622group_id=8032
Category: Build System
Group: None
Status: Closed
Resolution: Fixed
Priority: 5
Submitted By: John A. Murdie (jamurdie)
Assigned to:
Bugs item #679966, was opened at 2003-02-04 02:19
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=679966group_id=8032
Category: Compiler
Group: None
Status: Closed
Resolution: Fixed
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to:
Bugs item #679963, was opened at 2003-02-04 02:14
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=679963group_id=8032
Category: Profiling
Group: None
Status: Closed
Resolution: Fixed
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to:
Sigbjorn, Stef
Stef has tripped over a genuine bug in GHC 5.04. It's already fixed in
the head, but we hadn't back-patched it into 5.04. Since it has come up
again, its convinced us to back-patch, and the fix will be in the next
release of GHC, both on the 5.04 branch and in the HEAD.
The bug
Claus,
It may be possible to get the two representations together by applying the
predicate to a reader for x, generated from x, which would complement
something like Hood's writer for x, generated from x. Just as the context
demanding parts of x isn't aware of triggering observations, the
You should do the counting strictly:
Just n - case n+1 of n1 - addToFM f w n1
Careful - that case expression doesn't actually force n to be evaluated.
It's exactly equivalent to
let n1 = n+1 in addToFM f w n1
You need to use seq to force evaluation.
Cheers,
A couple of hours ago, I wrote (in reponse to Claus Reinke's suggestion):
Thanks for this further suggestion. A solution along these lines
might be
possible, but it would still be restricted ...
Actually a mild variant of Claus's proposal seems to work out
quite well. Another way to avoid
Does this mean you can womble along with Claus's suggestion? I'm
feeling a bit swamped at the moment, and not keen to undertake another
open-ended implementation exercise. So if you can manage without, and
perhaps use the experience to refine the specification of a Really
Useful Feature, that'd
Simon,
Does this mean you can womble along with Claus's suggestion? I'm
feeling a bit swamped at the moment, and not keen to undertake another
open-ended implementation exercise. So if you can manage without, and
perhaps use the experience to refine the specification of a Really
Useful
On Mon, Feb 17, 2003 at 11:00:13AM -, Simon Marlow wrote:
I have some CGI programs running with Hugs and I want to use GHC
instead.
What changes must I do to the .hs file?
Is it an easy job?
Depends on lots of things really.
The CGI library that comes with GHC is
Actually a mild variant of Claus's proposal seems to work out
quite well. Another way to avoid the problems with types is
to use a multi-parameter type class. Little example attached.
Glad to be of help. The need to shadow the data types is a bit
annoying, but then the whole generic bit
Program Transformation
Special Issue in the Science of Computer Programming
Deadline is 1.4.2003
Find CFC attached
or at http://www.cwi.nl/~ralf/pt-scp/
(Program transformation is of interest for many subscribers
of this list because program transformation is crucial
for the implementation of
International Conference on
Geometric Modeling Graphics (GMAG 2003)
(Previously, Computer Aided Geometric Design Symposium)
in co-operation with IEEE Computer Society
JULY 16-18, 2003
London, UK.
Aims and Scope:
===
Computer-Aided (CA) techniques for Geometric Modeling (GM) and
Dean Herington [EMAIL PROTECTED] writes:
Yes, getting the right amount of strictness--and in the right places--can be
tricky.
Tell me about it!
You should do the counting strictly:
Just n - case n+1 of n1 - addToFM f w n1
Thanks for the tip. Just performing this change didn't
You should do the counting strictly:
Just n - case n+1 of n1 - addToFM f w n1
Careful - that case expression doesn't actually force n to be evaluated.
It's exactly equivalent to
let n1 = n+1 in addToFM f w n1
You need to use seq to force evaluation.
Cheers,
**
** second call for papers and participation ***
**
Third International Workshop on
Reduction Strategies in Rewriting and
G'day.
On Mon, Feb 17, 2003 at 01:44:07AM -0500, Mike T. Machenry wrote:
I was wondering if it's better to define them as type classes with the
operations defined in the class. What do haskellian's do?
I can't speak for other Haskellians, but on the whole, it depends.
Here's the common
Title: FM03 CFP- Deadline is
approaching
Sorry if some of you receive multiple copies of this message.
Stefania Gnesi (FM2003 General Chair)
==
Call for Papers
File reading is not a pure operation: running out
of file descriptors is a good counter-example.
How does this differ from running out of memory whilst trying
to evaluate something?
You're absolutely right, of course.
I think the point is that by using implicit memory allocation we've
Simon Marlow [EMAIL PROTECTED] writes:
To fix these
problems you have to think carefully about strictness and demand in your
program. For memory we have heap profilers to help out, but we don't
have I/O descriptor profilers for lazy I/O!
At the department we use Haskell for several courses and as a modelling
tool in master- and PhD-thesis. A few years ago Damir Medak held a short
internal workshop to answer most of the beginners questions and I
created a tutorial text from his material.
The tutorial could be useful for beginners
Hi Sarah,
if Haskell - MetaPost - Postscript is good for you, have a
look at FMP. It's somewhat old and doesn't cover the entire
MetaPost language, but works for me.
Feri.
___
Haskell-Cafe
Quoting Sarah Thompson [EMAIL PROTECTED]:
Has anyone done much work on outputting graphics in eps format directly from
Haskell?
...
Has anyone done anything already, or should I just pull down the PDF specs
from Adobe and weigh in and write a library from scratch? If I do the
latter, will
23 matches
Mail list logo
