wren ng thornton wrote:
> However, while the "logical" interpretation of Ertugrul's words may be
> that simple-mindedness implies performance-desire, that interpretation
> is not the only one available to the standard interpretation of his
> words, nor IMO the dominant interpretation. It is equal
On 5/16/12 7:43 AM, Yves Parès wrote:
On the one hand, characterizing those who desire the best performance
possible as "simple-minded" is, at best, a gross over-generalization. Like
you, I work in a field where optimization is king (e.g., in machine
translation, program runtimes are measured in
Yes I totally agree, they have different kind. A Normal Rule is *
whereas a Meta Rule is * -> *.
But I have no experience with typeclasses. That could be what I'm looking for!
What they have in common? Well, Id' say that a rule (whatever sort it is) can:
- change the state of the game when executed
I've been following the topic in both threads. Very nice discussion.
On 18 May 2012 18:51, Isaac Gouy wrote:
>
> Moreover, being absolutely sure that the algorithms are in some sense
> "identical" might make comparison pointless - for example, when the same
> assembly
> is generated by gcc from
I wonder if you want a typeclass here, rather than a type? A Normal Rule is
pretty much a State Transformer, while a Meta Rule seems like a
higher-order function on Normal Rules[*]. These are different kinds of
things --- and I say "kind" advisedly --- so perhaps better to define the
specific commo
Hi Christian,
thanks for the reply. I'm on a very similar boat regarding machine
learning as you.
What I'm interested in is AGI (Artificial General Inteligence), where
the machine learning is general (not specialized and limited in some
kind of way). I was thinking to make a small applicati
> I find both heavy and redundant. The first forces me to specify if I want
> an argument of not (with the constructors MR and NR)
I'm sorry, I don't understand what you mean here.
> Do you know of a construction/abstraction that allows having or not an
> argument (a variable number of arguments,
Hi everybody,
I'm still working on implementing a nomic game in Haskell.
Although the game is pretty advanced, I'm still confused by one fundamental
question:
A nomic game is composed of rules.
A Rule is a sort of little program submitted by the player during the game.
They come in two fashions:
-
- Original Message -
> From: "o...@cs.otago.ac.nz"
> Sent: Friday, May 18, 2012 9:38 AM
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
-snip-
>> and if we want
>> to compare *languages*, we should use identical algorithms to make the
>> comparison fair.
>
> In the permu
>> There was and is no claim that method 2 is "much harder
>> to implement in C or C++". In fact both methods *were* implemented
>> easily in C.
>
> OK, got that now. So Haskell doesn't have a *big* advantage over C w/r
> to the ease of implementation of both algorithms?
In the case of these spe
- Original Message -
> From: Richard O'Keefe
> Sent: Thursday, May 17, 2012 8:30 PM
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
-snip-
> The claim was and remains solely that
> THE TIME DIFFERENCE BETWEEN *ALGORITHMS*
> can be bigger than
> THE TIME DIFFERENCE BETWEEN
I tried this and all other examples I could find.
They didn't work. I hadn't find any explanation yet.
And I don't know how I can get more information about errors.
I believe Plugins uses GHC API internally.
Нowever code like [1] works well for me on Linux and Windows.
I think I'll stay with this
plugins-auto has a demo in the darcs repo:
http://www.patch-tag.com/r/facundo/plugins-auto/snapshot/current/content/pretty/demo
Does that work for you ?
- jeremy
On Wed, May 16, 2012 at 9:46 AM, Андрей Янкин wrote:
> Hi,
>
> I'm newbie and I've got a problem.
>
> I'm trying to get example prog
Hello Haskellers!
Did you see Ambassador Peyton Jones in Scala land? Simon was recently at
ScalaDays 2012 (a large gathering for professional Scala users) giving a
[keynote talk on Cloud Haskell][v1] (one hour video). Cloud Haskell is
a pretty exciting new development in the Haskell space, providi
I have a related-seeming question:
Say I have a type class with methods, and some functions implemented
on top of it. The class methods are inherently unsafe. Instances of
the class are supposed to satisfy some conditions, and if those
conditions are met, the functions built on top are safe.
So s
> Date: Fri, 18 May 2012 15:30:09 +1200
> From: "Richard O'Keefe"
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
> To: Roman Werpachowski
> Cc: haskell-cafe@haskell.org
> Message-ID:
> Content-Type: text/plain; charset=us-ascii
>
>
> On 17/05/2012, at 10:07 PM, Roman Werpachowski wrot
Hi all,
I have implemented max-sum/sum-product in c++ before and a while ago,
did the same in Haskell.
I don't think my implementation is as idiomatic Haskellish as I would
like, and I have so far not
published it and also not looked at it for a little while (since I
have some more projects :) ).
17 matches
Mail list logo
