On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently contains '$' and there is no way
to define operation with a lower precedence
This could be solved by the
There should be a separate, moderated Haskell-announcements list. I
filter out haskell-cafe into a folder and read it separately from my
main inbox, but I'd like to have important announcements directly into
my inbox, and haskell@haskell.org still has some chatty
questions-and-answers sessions.
But DEC's language FOCAL had fractional line numbers. :)
On Nov 7, 2006, at 06:00 , Henning Thielemann wrote:
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently
Hi all,
I'd like to announce that we have a new team of maintainers in place
for wxHaskell, so we're hoping that this list will see a significant
increase in activtiy in the future.
We have several near-term objectives, which will likely occur in
roughly the order below:
* Pull together all of
On Mon, 6 Nov 2006, alex wrote:
I originally did this screencast a while ago for a 6 minute constrained
talk which explains why it's so short. This was about my first Haskell
program, I've progressed some since this experiment and will make a new
screencast soon.
I also tried to create
This message seems to have lingered in obscuriy for a while, I only just
received it.
What about
permLev :: Int - (a - a - a) - [a] - [a]
permLev 0 _ _ = []
permLev 1 _ xs = xs
permLev k f xs
= do x - xs
y - permLev (k-1) f xs
return (f x y)
l1 :: [(String,Double)]
l1 =
Hello Diego,
Tuesday, November 7, 2006, 3:27:51 PM, you wrote:
There should be a separate, moderated Haskell-announcements list. I
you can also read Haskell Weekly News for this purpose
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
Hello Jeremy,
Friday, October 27, 2006, 7:12:44 PM, you wrote:
I'd ask the community to send patches via this list.
i suggest to use [EMAIL PROTECTED] for this purpose. at least
other libs maintained there
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
Hello Nuno,
Monday, October 30, 2006, 8:45:24 PM, you wrote:
What am i coding in specific? I receive a list in the form:
-- l1 is a pair of the identifier and the associated probability
l1 = [(A,0.6),(B,0.2)]
I must return the permutation with k levels; for example:
[EMAIL PROTECTED] wrote:
Hello Dan,
Saturday, November 4, 2006, 5:07:15 AM, you wrote:
Here's an idea that (I think) is useful and backwards compatible:
fractional and negative fixity.
yes, i think the same. for example, once i've tried to define postfix
'when' operator like those in
Diego Navarro [EMAIL PROTECTED] writes:
There should be a separate, moderated Haskell-announcements list. I
filter out haskell-cafe into a folder and read it separately from my
main inbox, but I'd like to have important announcements directly into
my inbox, and haskell@haskell.org still has
What you're trying to do is called permutations with repetition, whereas
permutations (unqualified) usually refers to permutations without repetition
(and that's what the Haskell code you found is doing).
See http://en.wikipedia.org/wiki/Permutations_and_combinations
To get the result you
I'm curious about the implementation of bang patterns, and the
implications for performance. Previously on this list, Lemmih has
pointed out that throwing in an extra `seq` here and there to force
strictness is a bad idea, unless you do it very carefully. He points
out that the strictness
Having thought longer about it, it seems to be an issue with
functional dependencies and overlapping instances.
Perhaps, because an overlapping instance may be defined in some other
module which would trump the Iso instance for Either, the type
inference mechanism cannot commit to the instance
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/FixityResolution
I've added the proposal to the end of that page. In fact, the page
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki
/FixityResolution
I've added the proposal to the end of
On Tue, 7 Nov 2006, Simon Marlow wrote:
This is a much more heavyweight change, and its not a clear win.
Haskell 2 ? :-)
If you'd like to make a concrete proposal, then feel free to do so and
I'll make sure it gets onto the wiki.
What about the one of Jón Fairbairn ?
On 2006-11-07 at 18:30+0100 Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
This is a much more heavyweight change, and its not a clear win.
Haskell 2 ? :-)
If you'd like to make a concrete proposal, then feel free to do so and
I'll make sure it gets onto the wiki.
On Wednesday 08 November 2006 05:41, DavidA wrote:
To get the result you want, take the list of (letter, probability) pairs,
and generate the Cartesian product of k copies of itself.
cartProd 0 xs = [[]]
cartProd k xs = [x:ys | x - xs, ys - cartProd (k-1) xs]
The result is all sequences of
On Wednesday 08 November 2006 08:23, Daniel McAllansmith wrote:
Ahhh, whoops. It seems that lack of compilation errors is not a universal
sign that a haskell program is correct.
permute 0 d = mkD []
mkD doesn't allow distributions with 0 sum probabilities, so you'd need to
restrict the
On Tue, 2006-11-07 at 14:29 +0100, Henning Thielemann wrote:
I also tried to create some music with the SuperCollider wrapper by Rohan
Drape and the Haskore music package.
That's great, I have used the OSC part of the wrapper but not the rest,
and haven't looked at Haskore yet but have some
Hello all,
I suggest [EMAIL PROTECTED], the GUI task force mailing list; nothing is
going on there at the moment, but it seems the most appropriate list.
On Tue, 07 Nov 2006 14:52:24 +0100, Bulat Ziganshin
[EMAIL PROTECTED] wrote:
Hello Jeremy,
Friday, October 27, 2006, 7:12:44 PM,
On 07/11/06, Jon Fairbairn [EMAIL PROTECTED] wrote:
I must say though, that I don't like the reasoning that we
can put in fractional fixities because it's a small
change. The way to hell is through a series of small
steps. If using integers to express fixities is a bit of a
hack, switching to
I don't see how it's too complex. Isn't
infixl ??
prec ?? $
(??) = whenOperator
exactly what you want to say?
Sure you can solve the problem with negative fixities, but that's less
expressive than the above (the total order is actually an
over-specification). You want ?? to bind more
Let's remember that if something is broke, it's only _right_ to _fix_
it. I patiently waited for someone else to make that pun.
Understanding the language won't be much harder, but understanding
fixity declarations will become a task. Consider:
infixl -1.7521 -- what and why?
As the operator
On Nov 7, 2006, at 11:47 , [EMAIL PROTECTED] wrote:
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/
I started this e-mail thread on HaskellCafe instead of HaskellPrime
because it was minimal, backwards-compatible, valid Haskell 98 (or very
nearly so) and could go (now) into GHC if someone saw fit to put it in.
If you think C++ is not overly complicated, just what is a protected
abstract
David House wrote:
Also, it provides an infinite space for fixities. I think the problem
'binds tighter than X but not as tight as Y', where X and Y are only
fixity integer apart is somewhat common, and this would fix it. It
would allow for extensibility into the future, where the operator
by all means, lets have warm fuzzy precedence declarations
infix(nearly right) (exp (2*i*pi) + 1) :-)
infix(mostly left) (((\x-cos x + i*(sin x)) (2*pi)) + 1) (-:
who says that all the fun has to start in the type system?-)
we would probably need to refer to hyperreals, in order to
29 matches
Mail list logo
