rewrite rules diagnostics

2000-04-19 Thread Ross Paterson
(Rewrite rules are very nice, by the way.) The User's Guide says: * Use -ddump-simpl-stats to see what rules are being fired. If you add -dppr-debug you get a more detailed listing. but this only happens if the preprocessor symbol DEBUG is defined in simplCore/SimplMonad.lhs.

RE: What's in an interface? Unnecessary recompilation again

2000-04-19 Thread Simon Peyton-Jones
Fair enough. But would you like to suggest an algorithm GHC could use to decide what to put in the .hi file? You can't be suggesting that it parse literal strings?? | -Original Message- | From: George Russell [mailto:[EMAIL PROTECTED]] | Sent: 14 April 2000 13:49 | To: [EMAIL

Re: What's in an interface? Unnecessary recompilation again

2000-04-19 Thread George Russell
Simon Peyton-Jones wrote: Fair enough. But would you like to suggest an algorithm GHC could use to decide what to put in the .hi file? Well that's a big question. As I understand it, the errant value, lvl20, is a string representing an error message (which I suppose is to be thrown in the

Inlining errors...

2000-04-19 Thread Jan-Willem Maessen
George Russell writes: Well that's a big question. As I understand it, the errant value, lvl20, is a string representing an error message (which I suppose is to be thrown in the event of a matching failure). Since it should only be used on error, surely there is no speed benefit to inlining

RE: Binary Search Tree debugging

2000-04-19 Thread Mark P Jones
Hi Andrew, | Hey all.. I was wondering if somebody might offer me some assistance in | trying to debug some code I wrote to check whether a tree is a binary | search tree.. For some reason it always comes back as false! :( Thanks | much! One of the great things about functional programming is

RE: libraries for Integer

2000-04-19 Thread Mark P Jones
Hi Sergey, | In what way the Haskell implementations may use the GMP library? | (GNU Multi-Precision integers ?) Hugs 98 doesn't use gmp at all. For legal reasons (later rendered irrelevant by changes to the Hugs license), Hugs used it's own implementation of multi-precision integers. | And

Re: libraries for Integer

2000-04-19 Thread George Russell
Mark P Jones wrote: I guess that H/Direct would be the best way to take advantage of these right now. I agree actually. Integer only needs to be an implementation of multiprecision arithmetic; we shouldn't tie it to GMP. There are other multiprecision arithmetic packages out there, for

Re: libraries for Integer

2000-04-19 Thread Marc van Dongen
George Russell ([EMAIL PROTECTED]) wrote: : I agree actually. Integer only needs to be an implementation of : multiprecision arithmetic; we shouldn't tie it to GMP. There are : other multiprecision arithmetic packages out there, for example But it is pretty fast. : the LIP package included

Re: libraries for Integer

2000-04-19 Thread George Russell
Marc van Dongen wrote: Do you have any data about comparisons with this or other packages? I've just looked around Dave Rusin's page: http://www.math.niu.edu/~rusin/known-math/index/11YXX.html but it doesn't seem to contain any up-to-date comparisons; in particular not of GMP 3. There are

Re: libraries for Integer

2000-04-19 Thread George Russell
George Russell wrote: (GMP is faster if you use the mpn_ functions, but then you have to do all your own allocation and only get non-negative integers.) Sorry, I meant GMP is faster if you use mpn_ than if you use the other GMP functions, not that the mpn_ functions are faster than LIP.

Re: libraries for Integer

2000-04-19 Thread Marc van Dongen
George Russell ([EMAIL PROTECTED]) wrote: [...] : Sorry I can't be more helpful. But there is unlikely to be a simple : answer to the question "Does LIP or GMP multiply numbers fastest?"; : it will depend on how big the numbers are, what platform you are using, : and how much difficult the

RE: coercing newtypes

2000-04-19 Thread Simon Peyton-Jones
| Many of you have run across the problem with | newtypes that, although it is very cheap to | coerce between the newtype and the base type, it | can be very expensive to coerce between, say, | a list of the newtype and a list of the base type. | Stephanie Weirich and I are working on a proposal

Re: libraries for Integer

2000-04-19 Thread S.D.Mechveliani
No. It is all right. For example, gcdExt 4 6 = (2,-1,1),so -1*4 + 1*6 = 2 = gcd 4 6. Maybe, you forgot of negatives? -- Sergey Mechveliani [EMAIL PROTECTED]

Re: libraries for Integer

2000-04-19 Thread Marcin 'Qrczak' Kowalczyk
Wed, 19 Apr 2000 10:19:08 +0400 (MSD), S.D.Mechveliani [EMAIL PROTECTED] pisze: I have an impression that Haskell-98 calls `Integral' various models for the domain of integer numbers. And this is for Haskell-98'. While the good standard of future (I hope for Haskell-2) has, to my mind, to

math libraries

2000-04-19 Thread Sebastian Schulz
Hi folks! Where can I find math libraries with functions for differential and integration calculus, statistics, lin. algebra, ...? Regards Sebastian -- | Sebastian Schulz

Use of irrefutable

2000-04-19 Thread Mike Jones
Hi, I have a rather naive question, being new to Haskell. I am looking at the Hawk Signal module, where the following definition occurs: lift1 f (List xs) = List $ lazyMap f xs where lazyMap f ~(x:xs) = f x : lazyMap f xs Now setting aside how the function is used in Hawk, I ran a