Re: collecting requirements for FDs

2006-04-12 Thread Jean-Philippe Bernardy
Hello, I just moved the documentation (still accessible from the below wiki page) to here: http://users.skynet.be/jyp/html/collections/Data.Collections.html the source being: http://darcs.haskell.org/packages/collections/Data/Collections.hs And, since you asked for it, there is something I think

Re: the MPTC Dilemma (please solve)

2006-03-19 Thread Jean-Philippe Bernardy
On 3/18/06, Manuel M T Chakravarty <[EMAIL PROTECTED]> wrote: > Here addition and multiplication on Peano numerals using MPTCs and FDs: > > data Z > data S a > > class Add a b c | a b -> c > instance Add Z b b > instance Add a b c => Add (S a) b (S c) > >

darcs patch: add Data.Set.notMember and Data.Map.notMember / generalized infix notation use case

2006-03-11 Thread Jean-Philippe Bernardy
Patch applied. Still, In time, I suppose the somewhat ugly not (element `member` set) sould be addressed by a mixture of generalized infix notation and the definition of such an operator: f /. g = \x y -> f (g x y) allowing element `not/.member` set Cheers, JP. On 3/11/06, Cale Gibbard <[EMA

Re: Export lists in modules

2006-02-23 Thread Jean-Philippe Bernardy
I lost track of what is the issue being tackled here. What's broken with the current way of specifying exported entities? Imho it's the best system that I've seen (across all languages I know). A lot of language chose to separate interface from implementation in source files. (eg. Ada) I find thi