RE: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Simon Peyton-Jones
Sounds good to me. I wonder whether the haskell home page http://haskell.org should say something like This entire site is a Wiki, and is maintained by its users. To find out how to contribute, go here, where here gives guidance about logging in, and your page-naming guidelines?

[Haskell] PPDP'06 -- Call for Papers

2006-02-21 Thread Michael Maher
[Apologies for multiple copies] Preliminary Call for Papers: PPDP 2006 Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Venice, Italy, 10-12 July, 2006 IMPORTANT DATES Submission 15 March

[Haskell] Fast unboxed references for the IO and ST monads

2006-02-21 Thread Bulat Ziganshin
Hello oleg, Wednesday, February 08, 2006, 8:37:55 AM, you wrote: I suggest you follow the same scheme as the unboxed array types, and have IOURef/STURef types, parameterised over the element type. Of course, we should have instances for all of the primitive numeric types plus Ptr,

Re: [Haskell] Re: Question for the haskell implementors: Arrays, unsafePerformIO, runST

2006-02-21 Thread Malcolm Wallace
John Meacham [EMAIL PROTECTED] wrote: I generalized this primitive to drop__ :: a - b - b Also known in the Prelude as const... The difference is that you propose it be primitive, with the intention that a clever compiler should not be able to bypass it by inlining its definition and

Re: [Haskell] Long live Edison

2006-02-21 Thread Malcolm Wallace
Robert Dockins [EMAIL PROTECTED] wrote: On Feb 20, 2006, at 5:19 PM, [EMAIL PROTECTED] wrote: Data.Set, Data.Map, Data.Hash and the various Array interfaces are all inconsistent in subtle ways, so whatever you do, do not take them as the ideal to which Edison should aspire. This is

Re: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Graham Klyne
In making such changes, please bear in mind Cool URIs Don't Change: http://www.w3.org/Provider/Style/URI This isn't to say don't, but where possible, provide some redirection from the old name to the new name. To be effective, the web relies on stable links, so that references from elsewhere

Re: [Haskell] Re: Question for the haskell implementors: Arrays, unsafePerformIO, runST

2006-02-21 Thread John Meacham
On Tue, Feb 21, 2006 at 10:15:59AM +, Malcolm Wallace wrote: John Meacham [EMAIL PROTECTED] wrote: I generalized this primitive to drop__ :: a - b - b Also known in the Prelude as const... well, 'flip const' but yes. The difference is that you propose it be primitive, with the

[Haskell] CFP Implementation of Functional Languages IFL 2006, Budapest, 4-6, Sep. 2006

2006-02-21 Thread HORVATH Zoltan
FIRST ANNOUNCEMENT and CALL FOR PAPERS ** * 18th International Workshop on* * Implementation and Application of Functional Languages * *

Re: [Haskell] Re: IO == ST RealWorld

2006-02-21 Thread Jan-Willem Maessen
On Feb 20, 2006, at 5:57 PM, Ben Rudiak-Gould wrote: John Meacham wrote: ST doesn't have exceptions which IO does. It would be no good to make ST pay for the cost of exception handling. GHC handles them behind the scenes (I think?) but in jhc they are explicit and IO is defined as follows:

Re: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. Februar 2006 10:56 schrieb Graham Klyne: In making such changes, please bear in mind Cool URIs Don't Change: http://www.w3.org/Provider/Style/URI This isn't to say don't, but where possible, provide some redirection from the old name to the new name. To be effective, the

Re: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. Februar 2006 11:17 schrieb Simon Peyton-Jones: Sounds good to me. I wonder whether the haskell home page http://haskell.org should say something like This entire site is a Wiki, and is maintained by its users. To find out how to contribute, go here, where here gives

[Haskell] Re: Question for the haskell implementors: Arrays, unsafePerformIO, runST

2006-02-21 Thread Simon Marlow
John Meacham wrote: On Tue, Feb 21, 2006 at 10:15:59AM +, Malcolm Wallace wrote: John Meacham [EMAIL PROTECTED] wrote: I generalized this primitive to drop__ :: a - b - b Also known in the Prelude as const... well, 'flip const' but yes. The difference is that you propose it be

Re: [Haskell] Re: IO == ST RealWorld

2006-02-21 Thread John Meacham
On Mon, Feb 20, 2006 at 10:57:23PM +, Ben Rudiak-Gould wrote: could static analysis then eliminate the test for FailIO in ST code? It would be pretty cool if the answer was yes, since it would mean that merging IO and ST would be an optimization instead of a pessimization (the test

[Haskell] Re: Question for the haskell implementors: Arrays, unsafePerformIO, runST

2006-02-21 Thread John Meacham
On Tue, Feb 21, 2006 at 11:04:40PM +, Simon Marlow wrote: Your drop__ reminds me of GHC's touch#, which is like drop__ in the IO monad. We use it to control lifetimes, eg. inside withForeignPtr. You could implement drop in terms of touch#: drop__ a b = case touch# a realworld# of

Re: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Davor Cubranic
On 2/21/06, Graham Klyne [EMAIL PROTECTED] wrote: In making such changes, please bear in mind Cool URIs Don't Change: http://www.w3.org/Provider/Style/URI This isn't to say don't, but where possible, provide some redirection from the old name to the new name. To be effective, the web

Re: [Haskell] page renaming on the Haskell Wiki

2006-02-21 Thread Donald Bruce Stewart
cubranic: On 2/21/06, Graham Klyne [EMAIL PROTECTED] wrote: In making such changes, please bear in mind Cool URIs Don't Change: http://www.w3.org/Provider/Style/URI This isn't to say don't, but where possible, provide some redirection from the old name to the new name. To be

trouble running GHCi 6.4 on PowerPC GNU/Linux

2006-02-21 Thread K.D.P.Ross
Hello- I am having a bit of trouble running GHCi on my GNU/Linux distribution and was referred to this mail address by the crash message: [begin terminal session- $ ghci ___ ___ _ / _ \ /\ /\/ __(_) / /_\// /_/ / / | | GHC Interactive, version 6.4, for Haskell 98. / /_\\/

weird activation record found on stack

2006-02-21 Thread Ben Clifford
Hello. I got this one off. The rest of the time this program gives a simple Segmentation Fault near startup (about 1 in 5 times), and the other 4 in 5 times runs through to completion. $ ~/src/haskellgitmaildir/a.out master mundungusmaster base=aeb5d7eb11acbb81d77f37d381b75a51a8897eb9

memory allocation (non) bug

2006-02-21 Thread Iain Gray
Running primes1 from the following code in The Haskell Road to Logic, Maths and Programming ldp :: Integer - Integer ldp n = ldpf primes1 n ldpf :: [Integer] - Integer - Integer ldpf (p:ps) n | rem n p == 0 = p | p^2 n = n | otherwise= ldpf ps n primes1

Re: weird activation record found on stack

2006-02-21 Thread Simon Marlow
Ben Clifford wrote: Hello. I got this one off. The rest of the time this program gives a simple Segmentation Fault near startup (about 1 in 5 times), and the other 4 in 5 times runs through to completion. $ ~/src/haskellgitmaildir/a.out master mundungusmaster

Re: trouble running GHCi 6.4 on PowerPC GNU/Linux

2006-02-21 Thread Simon Marlow
K.D.P.Ross wrote: Hello- I am having a bit of trouble running GHCi on my GNU/Linux distribution and was referred to this mail address by the crash message: [begin terminal session- $ ghci ___ ___ _ / _ \ /\ /\/ __(_) / /_\// /_/ / / | | GHC Interactive, version 6.4, for

Re: ghci command history broken under rxvt and xterm

2006-02-21 Thread Bruno Martínez
On Mon, 20 Feb 2006 12:10:03 -0200, Simon Marlow [EMAIL PROTECTED] wrote: Bruno Martínez wrote: When using ghci with rxvt under cygwin, the command history doesn't work. When I press the up arrow, for example, the cursor moves up, instead of showing the previous command. xterm has the

Re: Pragmas for FFI imports

2006-02-21 Thread Malcolm Wallace
On Fri, Feb 17, 2006 at 01:45:27AM +0200, Einar Karttunen wrote: I would like to propose two pragmas to be included in Haskell' for use with FFI. One for specifying the include file defining the foreign import (INCLUDE in ghc) and an another for defining a library that the foreign import

Re: Export lists in modules

2006-02-21 Thread Malcolm Wallace
Jared Updike [EMAIL PROTECTED] wrote: I am not sure if this has been mentioned before, but something I would really find useful is the ability to tell Haskell to export everything in a function except for some named functions. No one has responded so ... I believe some people (perhaps

Re: Export lists in modules

2006-02-21 Thread Cale Gibbard
On 21/02/06, Malcolm Wallace [EMAIL PROTECTED] wrote: There is also the issue that we might adopt the proposal to allow (and perhaps eventually, to require) type signatures on export lists. If so, then it would be kind of ridiculous to have interface signatures only for the things you are

Re: Pragmas for FFI imports

2006-02-21 Thread Duncan Coutts
On Mon, 2006-02-20 at 19:59 -0800, John Meacham wrote: On Fri, Feb 17, 2006 at 01:45:27AM +0200, Einar Karttunen wrote: I would like to propose two pragmas to be included in Haskell' for use with FFI. One for specifying the include file defining the foreign import (INCLUDE in ghc) and an

Re: Pragmas for FFI imports

2006-02-21 Thread Einar Karttunen
On 21.02 11:50, Duncan Coutts wrote: I'd just like to note that this shouldn't be the only way to specify this info. For many real FFI bindings we don't know the right search paths, defines, libs, lib link-time search paths, lib runtime search paths etc until we start configuring on the target

Re: Export lists in modules

2006-02-21 Thread Georg Martius
On Tuesday 21 February 2006 11:40, Malcolm Wallace wrote: Jared Updike [EMAIL PROTECTED] wrote: I am not sure if this has been mentioned before, but something I would really find useful is the ability to tell Haskell to export everything in a function except for some named functions.

Module System

2006-02-21 Thread Georg Martius
Hello, I have some proposals for changes of the hierarchical module system as it is at the moment. Goals: - easy refactoring at Module/Package level - easier import/export of trees of modules (useful for any larger library) - relative imports/exports - deep import or export lists

Re: Module System

2006-02-21 Thread Henrik Nilsson
Hi all, Georg Martius wrote: I have some proposals for changes of the hierarchical module system as it is at the moment. [...] The hierarchical name can be derived from the place in the filesystem. This is not a comment about the above proposal in itself, which arguably has its merits,

Re: Module System

2006-02-21 Thread Georg Martius
Hi Henrik, On Tuesday 21 February 2006 16:50, Henrik Nilsson wrote: Hi all, Georg Martius wrote: I have some proposals for changes of the hierarchical module system as it is at the moment. [...] The hierarchical name can be derived from the place in the filesystem. This is not a

Re: Module System

2006-02-21 Thread Henrik Nilsson
PS: True, but do these differences matter to us? Sorry for my naivety, but I can't see that much problems, expect very old 8.3 restrictions, but they are history now! Here's a concrete example, then. Windows file systems don't distinguish case. Thus the two different Haskell modules FOO

Re: Export lists in modules

2006-02-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. Februar 2006 04:41 schrieb John Meacham: on this note, I thought it would be nice to do a 'mostly unqualified' import. import Foo qualified(foo,bar) which will have the effect of import Foo hiding(foo,bar) import qualified Foo(foo,bar) since usually you can import a

Array interface refactoring

2006-02-21 Thread Alson Kemp
We had a short discussion on the IRC channel the other day about Arrays. I advocated that we do some refactoring work and didn't meet with overwhelming disagreement, so I wanted to propose that the Arrays interfaces be refactored in Haskell'. As a Haskell new-ish-bie, the various Array

New syntax

2006-02-21 Thread Ketil Malde
Ketil Malde [EMAIL PROTECTED] writes: Personally, I would greatly prefer to have libraries that do not clash with common Prelude functions. Slightly related in spirit: Often additions to the language tends to change the meaning of existing programs: Implicit parameters broke programs using ?

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Ashley Yakeley
Josef Svenningsson wrote: This is one of the things that the Clean people got right. In Clean, my examples from above would look like: class MonadPlus m | Monad m where ... class Ix a | Ord a where .. instance Eq (Ratio a) | Integral a where ... Not quite the same complaint, but

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Sebastian Sylvan
On 2/22/06, Ashley Yakeley [EMAIL PROTECTED] wrote: Josef Svenningsson wrote: This is one of the things that the Clean people got right. In Clean, my examples from above would look like: class MonadPlus m | Monad m where ... class Ix a | Ord a where .. instance Eq

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Ashley Yakeley
Sebastian Sylvan wrote: Not quite the same complaint, but I've always been bothered by the inconsistent use of =. I would prefer A = B to mean if A, then B. Accordingly: class Monad m = MonadPlus m By your definition, couldn't what we have now (class Monad m = MonadPlus m) be read as If m

Re: the MPTC Dilemma (please solve)

2006-02-21 Thread Ross Paterson
On Tue, Feb 21, 2006 at 03:50:52PM +0800, Martin Sulzmann wrote: A depth limit is not enough. For confluence we need that *all* derivations for a particular goal terminate. Once we have confluence we get completeness of the inference checks. So without a static test for termination (though

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Claus Reinke
class Monad m = MonadPlus m where ... class Ord a = Ix a where ... instance Integral a = Eq (Ratio a) where ... still difficult?-) works just as well when the constraint lists get longer. claus ps. I like that its the same way as for type signatures.

superclass implications (was: The worst piece of syntax in Haskell)

2006-02-21 Thread Claus Reinke
Not quite the same complaint, but I've always been bothered by the inconsistent use of =. I would prefer A = B to mean if A, then B. that keeps bugging me, too. but switching the implication is not going to help (although others have proposed the same). here's how I keep my peace with that

Re: Module System

2006-02-21 Thread John Meacham
On Tue, Feb 21, 2006 at 03:50:29PM +, Henrik Nilsson wrote: I'm already somewhat unhappy about the way most present Haskell tools map module names to path names (I'd generally prefer to have the possibility to flatten my file hierarchies by, say, using dots in my file names), but at least

Re: superclass implications (was: The worst piece of syntax in Haskell)

2006-02-21 Thread Claus Reinke
class Monad m = MonadPlus m if ..oops.. if Monad m, then declare MonadPlus m as follows.. ___ Haskell-prime mailing list Haskell-prime@haskell.org http://haskell.org/mailman/listinfo/haskell-prime

Re: Pragmas for FFI imports

2006-02-21 Thread John Meacham
On Tue, Feb 21, 2006 at 04:50:20PM -, Simon Marlow wrote: First of all, my position on this has always been (since we argued about this during the design of the FFI) that include files and libraries should be kept out of the source file and specified separately, since they are a part of

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Josef Svenningsson
On 2/22/06, Claus Reinke [EMAIL PROTECTED] wrote: class Monad m= MonadPlus mwhere ... class Ord a= Ix awhere ... instance Integral a= Eq (Ratio a)where ... still difficult?-) works just as well when the constraint lists get longer.This is the style I've adopted and it makes things a little better

Re: superclass implications

2006-02-21 Thread Ashley Yakeley
Claus Reinke wrote: class Monad m = MonadPlus mif ..oops.. if Monad m, then declare MonadPlus m as follows.. This gloss doesn't make sense. The act of declaration is a constant static property of the module, and cannot be conditional on the property of a variable. The module

Re: The worst piece of syntax in Haskell

2006-02-21 Thread Cale Gibbard
On 21/02/06, Ashley Yakeley [EMAIL PROTECTED] wrote: Sebastian Sylvan wrote: Not quite the same complaint, but I've always been bothered by the inconsistent use of =. I would prefer A = B to mean if A, then B. Accordingly: class Monad m = MonadPlus m By your definition, couldn't

Re: Array interface refactoring

2006-02-21 Thread Donald Bruce Stewart
alson: We had a short discussion on the IRC channel the other day about Arrays. I advocated that we do some refactoring work and didn't meet with overwhelming disagreement, so I wanted to propose that the Arrays interfaces be refactored in Haskell'. As a Haskell new-ish-bie, the various

Re: the MPTC Dilemma (please solve)

2006-02-21 Thread Martin Sulzmann
When I said type class acrobats I didn't mean to make fun of people like you who use type classes in a very skillfull way. Though, I tried (successfully :) ) to be provocactive. I agree with you there's a real need for unrestricted type class programming. After all, the Hindley/Milner subset of

Re: Array interface refactoring

2006-02-21 Thread Tomasz Zielonka
On Wed, Feb 22, 2006 at 03:39:48PM +1100, Donald Bruce Stewart wrote: And unsafeRead/unsafeWrite are too verbose. They are usually (almost always?) safe (since the code does its own checks), The same can be said about most uses of unsafePerformIO - you wouldn't be using it if you weren't

Re: [Haskell-cafe] Re: Associated Type Synonyms question

2006-02-21 Thread Martin Sulzmann
Claus Reinke writes: The main argument for ATS is that the extra parameter for the functionally dependend type disappears, but as you say, that should be codeable in FDs. I say should be, because that does not seem to be the case at the moment. My approach for trying the encoding was

[Haskell-cafe] Re: Streams: the extensible I/O library

2006-02-21 Thread Simon Marlow
Bulat Ziganshin wrote: Wednesday, February 08, 2006, 2:58:30 PM, you wrote: SM I would prefer to see more type structure, rather than putting SM everything in the Stream class. You have classes ByteStream, SM BlockStream etc, but these are just renamings of the Stream class. There SM are

[Haskell-cafe] Re: Hashtable woes

2006-02-21 Thread Simon Marlow
Brian Sniffen wrote: On 2/10/06, Ketil Malde [EMAIL PROTECTED] wrote: Hmm...perhaps it is worth it, then? The benchmark may specify hash table, but I think it is fair to interpret it as associative data structure - after all, people are using associative arrays that (presumably) don't

[Haskell-cafe] typesafe non-local returns in the IO monad

2006-02-21 Thread John Meacham
Although I am sure I am not the first to discover this, I thought it was a neat application of the runST trick. Safe non-local returns for the IO monad. What I mean by safe is that it is impossible to return to a context that no longer exists. the api is simple: module

[Haskell-cafe] Re: Emulating bash pipe/ process lib

2006-02-21 Thread Simon Marlow
Bulat Ziganshin wrote: Friday, February 10, 2006, 2:53:25 PM, you wrote: i'm not very interested to do something fascinating in this area. it seems that it is enough to do 1) non-blocking read of the entire buffer on input 2) flush buffer at each '\n' at output that should be enough to

RE: [Haskell-cafe] typesafe non-local returns in the IO monad

2006-02-21 Thread Simon Peyton-Jones
I'm not sure this works. Consider this newContinuation (\k - return (callContinuation k)) ... The partial application (callContinuation k) has no 's' in its type, and so can go anywhere. Simon | -Original Message- | From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf

[Haskell-cafe] Re: standard poll/select interface

2006-02-21 Thread Simon Marlow
John Meacham wrote: On Fri, Feb 10, 2006 at 12:26:30PM +, Simon Marlow wrote: in fact, I think this should be the basic API, since you can implement readFD in terms of it. (readNonBlockingFD always reads at least one byte, blocking until some data is available). This is used to partially

[Haskell-cafe] Re: standard poll/select interface

2006-02-21 Thread Simon Marlow
Bulat Ziganshin wrote: SM I don't think async I/O is a stream transformer, fitting it into the SM stream hierarchy seems artificial to me. yes, it is possible - what i'm trying to implement everything as tranformer, independent of real necessity. i really thinks that idea of transformers fit

[Haskell-cafe] Re: getChar + System.Cmd.system + threads causes hangups

2006-02-21 Thread Simon Marlow
Einar Karttunen wrote: Hello Using system or any variant of it from System.Process seems broken in multithreaded environments. This example will fail with and without -threaded. When run the program will print hello: start and then freeze. After pressing enter (the first getChar)

Re: [Haskell-cafe] Re: getChar + System.Cmd.system + threads causes hangups

2006-02-21 Thread Donn Cave
On Tue, 21 Feb 2006, Simon Marlow wrote: ... The reason for the deadlock is because getChar is holding a lock on stdin, and System.Cmd.system needs to access the stdin Handle in order to know which file descriptor to dup as stdin in the child process (the stdin Handle isn't always FD 0,

Re: [Haskell-cafe] Re: Hashtable woes

2006-02-21 Thread Chris Kuklewicz
Simon Marlow wrote: Brian Sniffen wrote: On 2/10/06, Ketil Malde [EMAIL PROTECTED] wrote: Hmm...perhaps it is worth it, then? The benchmark may specify hash table, but I think it is fair to interpret it as associative data structure - after all, people are using associative arrays that

Re: [Haskell-cafe] Constructor classes implementation

2006-02-21 Thread Daniel Fischer
Am Montag, 20. Februar 2006 13:35 schrieb Daniel Fischer: Cheers, Sean p.s. If you find any bugs, please let me know. Re bugs: 1. printGamma [] would print an unmotivated }, as witnessed by typeInf [] term14. 2. the case unify (ConT c) (AppT t1 t2) is missing. and unifying a

Re: [Haskell-cafe] Constructor classes implementation

2006-02-21 Thread Sean Seefried
Thank you for taking the time to look through the code. 1. printGamma [] would print an unmotivated }, as witnessed by typeInf [] term14. 2. the case unify (ConT c) (AppT t1 t2) is missing. and unifying a tyvar with itself fails. That probably doesn't occur in the inference-algorithm,

Re: [Haskell-cafe] typesafe non-local returns in the IO monad

2006-02-21 Thread John Meacham
On Tue, Feb 21, 2006 at 01:07:51PM -, Simon Peyton-Jones wrote: I'm not sure this works. Consider this newContinuation (\k - return (callContinuation k)) ... The partial application (callContinuation k) has no 's' in its type, and so can go anywhere. Ah, you are right. silly

Re: [Haskell-cafe] Re: standard poll/select interface

2006-02-21 Thread Donn Cave
On Tue, 21 Feb 2006, John Meacham wrote: Yeah, this is why I have held off on a specific design until we get a better idea of what the new IO library will look like. I am thinking it will have to involve some abstract event source type with primitive routines for creating this type from things

Re: [Haskell-cafe] Constructor classes implementation

2006-02-21 Thread Donald Bruce Stewart
sean.seefried: I still don't see clearly. So you've implemented the type inference algorithm from Jones' paper, good. But is there any significance or gain, apart from it being a nice and interesting exercise? No. Nor did I state that there was. There's a reason I posted this to

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread oleg
Martin Sulzmann wrote: - The type functions are obviously terminating, e.g. type T [a] = [[a]] clearly terminates. - It's the devious interaction between instances/superclasss and type function which causes the type class program not to terminate. Is there a possible fix? Here's a

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread Martin Sulzmann
This is not a counter-example to my conjecture. Let's consider the general case (which I didn't describe in my earlier email). In case we have an n-ary type function T (or (n+1)-ary type class constraint T) the conditions says for each type T t1 ... tn = t (or rule T t1 ... tn x == t) then

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread oleg
Let's consider the general case (which I didn't describe in my earlier email). In case we have an n-ary type function T (or (n+1)-ary type class constraint T) the conditions says for each type T t1 ... tn = t (or rule T t1 ... tn x == t) then rank(ti) rank(t) for each i=1,..,n I

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread Martin Sulzmann
[EMAIL PROTECTED] writes: Let's consider the general case (which I didn't describe in my earlier email). In case we have an n-ary type function T (or (n+1)-ary type class constraint T) the conditions says for each type T t1 ... tn = t (or rule T t1 ... tn x == t)

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread oleg
Martin Sulzmann wrote: Let's consider the general case (which I didn't describe in my earlier email). In case we have an n-ary type function T (or (n+1)-ary type class constraint T) the conditions says for each type T t1 ... tn = t (or rule T t1 ... tn x == t) then rank(ti) rank(t)

[Haskell-cafe] (Un)termination of overloading resolution

2006-02-21 Thread Martin Sulzmann
[EMAIL PROTECTED] writes: Martin Sulzmann wrote: Let's consider the general case (which I didn't describe in my earlier email). In case we have an n-ary type function T (or (n+1)-ary type class constraint T) the conditions says for each type T t1 ... tn = t (or rule