Re: Keep the present Haskell record system!

2006-03-04 Thread Claus Reinke
On Wed, Mar 01, 2006 at 08:26:14AM +, Henrik Nilsson wrote: > I'm increasingly convinced that the records should be left alone for > Haskell', possibly modulo some minor tweaks to polish the system. for the record:-) I'm not in favour of this part. But the main reason I can see for there b

partial type signatures/annotations/declarations..

2006-03-04 Thread Claus Reinke
when trying to look up the state of this proposal, I noticed: - there seem to be two parallel versions (probably signatures is an older form, and all references ought to point to annotations instead?): http://hackage.haskell.org/trac/haskell-prime/wiki/HaskellExtensions points to:

Re: Keep the present Haskell record system!

2006-03-04 Thread Benjamin Franksen
On Saturday 04 March 2006 19:35, Claus Reinke wrote: > a more promising approach would be to specify the user-level features > of the current system, then to show at least two translations: one > for the current desugaring, and a second one to demonstrate at least > one implementation of those feat

Re: relaxed instance rules spec (was: the MPTC Dilemma(pleasesolve))

2006-03-04 Thread Claus Reinke
On Thu, Mar 02, 2006 at 12:03:59PM -, Claus Reinke wrote: The way I interpret FDs implies that they introduce a systematic space leak into the inference process: if any stage in the inference uses *any* constraint with a class which is subject to an FD, that results in an additional bit of i

Re: relaxed instance rules spec (was: the MPTC Dilemma (pleasesolve))

2006-03-04 Thread Claus Reinke
What I'm trying to demonstrate here is that only during inference (ie. applying CHRs) we may come across cycles. Hence, the quest is to come up with *dynamic* termination methods. I think that's what you are interested in? first, lets clarify: all of this is happening before program runtime, so

Re: relaxed instance rules spec (was: the MPTC Dilemma(pleasesolve))

2006-03-04 Thread Claus Reinke
the translation into CHRs would be something like: class C a b | a -> b instance ctxt => C t1 t2 --> C a b <=> infer_C a b, memo_C a b.(two roles) infer_C a b <=> ctxt. (instance inference) memo_C a b1, memo_C a b2 => b1=b2. (class FD)

Re: relaxed instance rules spec (was: the MPTC Dilemma(pleasesolve))

2006-03-04 Thread Ross Paterson
On Sat, Mar 04, 2006 at 10:32:58PM -, Claus Reinke wrote: > >On Thu, Mar 02, 2006 at 12:03:59PM -, Claus Reinke wrote: > >>The way I interpret FDs implies that they introduce a systematic space > >>leak into the inference process: if any stage in the inference uses *any* > >>constraint with

If you really care, make sure it gets on the wiki (how to create a proposal)

2006-03-04 Thread isaac jones
I'm sure you've noticed that there is a lot of traffic on this list. I want to emphasize that if you really care about an idea, you should make sure it gets on the wiki in one way or another, or it may get lost in the mass of traffic on the mailing list: http://hackage.haskell.org/trac/haskell-pri