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 l

IFIP TCS2000 INFORMATION

2000-04-19 Thread Shinya MIYAKAWA
[Apologies for multiple copies] IFIP TCS2000 PRELIMINARY PROGRAM AND REGISTRATION INFORMATION ^ -- IFIP International Conference on Theoretical Computer Science

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 Ma

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

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

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

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 examp