RE: Problem building ghc-4.08.2: rename/RnHiFiles.hi-boot-5

2001-02-08 Thread Simon Marlow
Hi, I?m trying to build ghc-4.08.2 on SuSE Linux 7.0 and get the following error message: rename/RnEnv.lhs:11: Bad interface file: rename/RnHiFiles.hi-boot-5 rename/RnHiFiles.hi-boot-5:3 Interface file parse error; on input ` d ' I got the sources by cvs today. You

RE: Hello World program core dumps with GHC 4.08.1 on HPUX 10.20

2001-02-08 Thread BENNETT,ANDY (HP-Unitedkingdom,ex1)
Hello again, I've managed to get ghc working on my HP-UX box, and I thought I'd share my solution in case there is no better remedy available and someone else encounters the same problem. I'd be interested to know how the build to generate the hsc executable in the distribution download gets

RE: Hello World program core dumps with GHC 4.08.1 on HPUX 10.20

2001-02-08 Thread Simon Marlow
I'm not sure whether I'm doing something wrong, but I've just downloaded the HPUX 4.08.1 binary distribution of GHC and have installed it with GCC 2.95.2 (downloaded from HPUX porting site) along side it. I'm running these on HPUX 10.20. I seem to recall having some trouble with 2.95.2

Segmentation fault in program

2001-02-08 Thread T.J. Brown
Hi, I'm trying to write a program (in C) that calls a function that is implemented in Haskell. The inputs to the function is: a pointer to a buffer of unsigned longs, the length of the input buffer, and a pointer to a buffer of unsigned chars. The function is to convert the buffer of unsigned

Re: Fundeps and quantified constructors

2001-02-08 Thread anatoli
--- Tom Pledger [EMAIL PROTECTED] wrote: anatoli writes: : | The same error message is given for | | data Foo a = (Eq b) = MkFoo b Since the type variable a is orphaned, how about reducing it to this? data Foo = forall b . Eq b = MkFoo b This is possible (the semantics is

Re: Revamping the numeric classes

2001-02-08 Thread Bjorn Lisper
Also, what is the inferred type of, for example f x y = x + length y ? It can be Int - [a] - Int [Int] - [a] - [Int] and neither is more general than the other. And this is a simple function. Int - [a] - Int, since this is the type it will get in the original type system.

Re: Revamping the numeric classes

2001-02-08 Thread Bjorn Lisper
It is quite similar in spirit to the concept of principal type in Hindley-Milner type systems. An expression can have many types but only one "best" (most general) type in that system. Now, I'm not any kind of expert on this, but isn't the most general HM type one that encompasses the others,

Re: please help me

2001-02-08 Thread Ch. A. Herrmann
Hi Faizan, "FAIZAN" == FAIZAN RAZA [EMAIL PROTECTED] writes: FAIZAN Hello Please help me to solve this questions FAIZAN Question FAIZAN Cartesian Product of three sets, written as X x Y x Z is FAIZAN defined as the set of all ordered triples such that the FAIZAN first

Re: Revamping the numeric classes

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
On Thu, 8 Feb 2001, Bjorn Lisper wrote: Int - [a] - Int, since this is the type it will get in the original type system. This is a misunderstanding. the transformation of f l y , where l :: [Int] for instance, should depend only on the type of f and not its definition. It is the call to

Re: binary files in haskell

2001-02-08 Thread Fergus Henderson
On 08-Feb-2001, John Meacham [EMAIL PROTECTED] wrote: A nice advantage of using my mid-level routines is that there are very little requirements placed on 'Byte' as a type, this means that as long as to the outside world you only read in 8 bit values and spit 8 bit values out you can

Re: names, modules, types

2001-02-08 Thread Johannes Waldmann
There is exponential growth of possibilities in compound expressions. And I'm afraid that ambiguities would happen in unexpected places and it would not be easy to find where to add type signatures. Especially as there is less explicit type information than in many other statically typed

Re: names, modules, types

2001-02-08 Thread Fergus Henderson
On 07-Feb-2001, Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] wrote: So why is fmap separate now? Probably because having too much overloading causes ambiguities. Perhaps. But I think there may be other reasons too. Having fmap separate is useful for beginners and for teaching, because you can

Re: Revamping the numeric classes

2001-02-08 Thread Bjorn Lisper
I see. So you can transform arbitrary function of type a-b-c to a function of type [a]-b-[c], by applying \f x y - map (\z - f z y) x and similarly a-b-c to a-[b]-[c]. But then there are two ways of transforming a-b-c to [a]-[b]-[[c]] and the order of applying the former transformations does

Re: FranTK

2001-02-08 Thread Johannes Waldmann
want to install FranTk so other people can use it. I'm not sure this is possible. sure it is .. and it is rather easy to make it known to ghc (so that -syslib frantk works). just add these lines to the driver script (around line 2740, where all the other syslib entries live) frantk,

Re: `Covertible' class. Reply.

2001-02-08 Thread Marc van Dongen
S.D.Mechveliani ([EMAIL PROTECTED]) wrote: [snip] : The basic algebra library BAL : http://www.botik.ru/pub/local/Mechveliani/basAlgPropos/bal-pre-0.01/ : : suggests class Cast a b where cast :: a - b - a I just want to add that this is almost similar to a mechanism I've

ANNOUNCE: hmake-2.02 RPM packages

2001-02-08 Thread José Romildo Malaquias
On Thu, Feb 08, 2001 at 02:47:41PM +, Malcolm Wallace wrote: We are pleased to announce the release of version 2.02 of 'hmake', the intelligent compilation manager for Haskell compilers. http://www.cs.york.ac.uk/fp/hmake/ ftp://ftp.cs.york.ac.uk/pub/haskell/hmake/ I have built

Re: Job Adverts on haskell.org

2001-02-08 Thread Benjamin L. Russell
On Tue, 06 Feb 2001 15:27:54 + "C.Reinke" [EMAIL PROTECTED] wrote: Haskell.org has a page "Job Adverts". http://www.haskell.org/jobs.html [snip] A Adverts for positions involving Haskell - Positions in Academia - Positions in Industry [snip] Why not add a

Re: `Covertible' class. Reply.

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
Thu, 08 Feb 2001 09:41:55 +0300, S.D.Mechveliani [EMAIL PROTECTED] pisze: If s is an element of a certain domain, then one can use the construction cast s x to convert various data x to corresponding canonical values in the domain defined by s. Defining a

Re: Please help me

2001-02-08 Thread Ashley Yakeley
At 2001-02-08 13:49, FAIZAN RAZA wrote: write a Haskell function cartesianProduct which when given three lists (to represent three sets) of integers returns a list of lists of ordered triples. That's easy. Just define 'product' as a function that finds the cartesian product of any number of

Re: Revamping the numeric classes

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
On Thu, 8 Feb 2001, Tom Pledger wrote: nice answer: give the numeric literal 10 the range type 10..10, which is defined implicitly and is a subtype of both -128..127 (Int8) and 0..255 (Word8). What are the inferred types for f = map (\x - x+10) g l = l ++ f l ? I hope I can use them

Re: Please help me

2001-02-08 Thread Ashley Yakeley
At 2001-02-08 02:04, Ashley Yakeley wrote: That's easy. Just define 'product' as a function that finds the cartesian product of any number of lists, and then once you've done that you can apply it to make the special case of three items like this: cartesianProduct a b c = product [a,b,c] At

Re: Revamping the numeric classes

2001-02-08 Thread Jerzy Karczmarczuk
First, a general remark which has nothing to do with Num. PLEASE WATCH YOUR DESTINATION ADDRESSES People send regularly their postings to haskell-cafe with several private receiver addresses, which is a bit annoying when you click "reply all"... Brian Boutel after Dylan Thurston: Why

RE: Please help me

2001-02-08 Thread Chris Angus
Faizan, A clue is to use list comprehensions (which are very like ZF set notation) First think how you would define a cartesian product in set notation X x Y x Z = {(x,y,z) | ...} and then think how this is written in list comprehension notation Chris -Original Message- From:

RE: Show, Eq not necessary for Num [Was: Revamping the numeric c

2001-02-08 Thread Elke Kasimir
On 07-Feb-2001 Patrik Jansson wrote: (interesting stuff deleted) As far as I remember from the earlier discussion, the only really visible reason for Show, Eq to be superclasses of Num is that class contexts are simpler when (as is often the case) numeric operations, equality and show are

Re: Revamping the numeric classes

2001-02-08 Thread Dylan Thurston
On Thu, Feb 08, 2001 at 11:24:49AM +, Jerzy Karczmarczuk wrote: First, a general remark which has nothing to do with Num. PLEASE WATCH YOUR DESTINATION ADDRESSES People send regularly their postings to haskell-cafe with several private receiver addresses, which is a bit annoying when

Instances of multiple classes at once

2001-02-08 Thread Dylan Thurston
(Superficially irrelevant digression:) Simon Peyton-Jones came here today and talked about his combinator library for financial applications, as in his paper "Composing Contracts". One of the points he made was that a well-designed combinator library for financial traders should have

Re: Show, Eq not necessary for Num [Was: Revamping the numeric c

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
Thu, 08 Feb 2001 15:11:21 +0100 (CET), Elke Kasimir [EMAIL PROTECTED] pisze: However, what is missing for me is something like: type Comfortable a = (Show a, Eq a, Num a) = a or class (Show a, Read a, Eq a) = Comfortable a instance (Show a, Read a, Eq a) = Comfortable a I agree and

Re: Revamping the numeric classes

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
Thu, 8 Feb 2001 10:51:58 -0500, Peter Douglass [EMAIL PROTECTED] pisze: The first part of my question (not contained in your reply) is whether it is feasible to disable a developer's access to the "unsafe" numerical operations. import Prelude hiding (quot, rem, (/) {- etc. -}) import

Re: Revamping the numeric classes

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
Thu, 8 Feb 2001 21:41:56 +1100, Fergus Henderson [EMAIL PROTECTED] pisze: Should this define an instance for `foo T'? (I think not.) How about if the instance declaration is changed to instance bar T where f = 41 -- no definition for f2

Re: Revamping the numeric classes

2001-02-08 Thread Marcin 'Qrczak' Kowalczyk
Thu, 08 Feb 2001 11:24:49 +, Jerzy Karczmarczuk [EMAIL PROTECTED] pisze: The implicit coercion of numeric constants: 3.14 -=- (fromDouble 3.14) etc. is sick. What do you propose instead? (BTW, it's fromRational, to keep arbitrarily large precision.) Now, signum and abs seem to be

Re: Revamping the numeric classes

2001-02-08 Thread William Lee Irwin III
On Thu, Feb 08, 2001 at 08:30:31PM +, Marcin 'Qrczak' Kowalczyk wrote: Signum doesn't require Ord. signum z = z / abs z for complex numbers. I'd be careful here. \begin{code} signum 0 = 0 signum z = z / abs z \end{code} This is, perhaps, neither precise nor general

Re: GHC Core output

2001-02-08 Thread Erik Meijer
I would *really* love to see GHC componetized (TM); it would even be better if it would become easier to use the pieces. I would like to do experiments on smaller bits of the compiler using Hugs (ideally the whole thing!). When I was working on the Java/.NET backend I had to rebuild the whole

Re: Revamping the numeric classes

2001-02-08 Thread Tom Pledger
Marcin 'Qrczak' Kowalczyk writes: | On Thu, 8 Feb 2001, Tom Pledger wrote: | | nice answer: give the numeric literal 10 the range type 10..10, which | is defined implicitly and is a subtype of both -128..127 (Int8) and | 0..255 (Word8). | | What are the inferred types for | f =

RE: GHC Core Language

2001-02-08 Thread Andrew Tolmach
[moving to haskell-cafe] From: matt hellige [mailto:[EMAIL PROTECTED]] a quick question re: ghc's Core language... is it still very similar to the abstract syntax given in, for example, santos' "compilation by transformation..." (i think it was his dissertation?) and elsewhere, or has it

Re: Revamping the numeric classes

2001-02-08 Thread Brian Boutel
William Lee Irwin III wrote: The Standard Prelude serves its purpose well and accommodates the largest cross-section of users. Perhaps a Geek Prelude could accommodate the few of us who do need these sorts of schenanigans. Amen. --brian ___

RE: Haskell Implemetors Meeting

2001-02-08 Thread Simon Peyton-Jones
GHC transforms Haskell into "Core", which is roughly the second-order lambda calculus, augmented with let(rec), case, and constructors. This is an a small explicitly-typed intermediate language, in contrast to Haskell which is a very large, implicitly typed language. Getting from Haskell to