On Feb 11, 2007, at 0:12 , Robin Green wrote:
On Sat, 10 Feb 2007 23:37:04 +0100
Bjorn Bringert [EMAIL PROTECTED] wrote:
I've also recently changed the version number scheme on most of the
packages I maintain (which includes most of the packages required by
Hope) from a date-based one to a
On Sun, Feb 11, 2007 at 09:11:59AM +0100, Bjorn Bringert wrote:
Yeah, that would make specifying dependencies a bit of a drag. I
think I'll just rerelease all the packages as version 3000.0.0 or
something. Who cares if the version numbers look silly?
The Debian Project uses standardized
Joel,
Implementing Java RMI in Haskell sounds like a nightmare. Why not use
HTTP? You could easily write a wrapper Servlet that speaks XML or
JSON over HTTP, and deploy that to the Weblogic server. Unless you
don't have permission to deploy anything to that server for whatever
reason.
Yep, don't have access to the Weblogic server. I'm re-evaluating my
options, though, since I'm lazy by nature.
On Feb 11, 2007, at 12:30 PM, Neil Bartlett wrote:
Joel,
Implementing Java RMI in Haskell sounds like a nightmare. Why not
use HTTP? You could easily write a wrapper Servlet that
On 09/02/07, Paul Moore [EMAIL PROTECTED] wrote:
It probably wouldn't be hard to write a reasonably general wrapper for
this, but it's a bit late now so I'll leave that as an exercise :-)
Sigh. I tried to set this up (using a little external C routine to do
the API grunt work) and it doesn't
Hello Yitzchak,
Sunday, February 11, 2007, 4:14:39 AM, you wrote:
when I have time. What Bulat wrote is in my opinion
_exactly_ what is needed.
i has a pedagogical talent :D searching for Haskell teacher position :)))
--
Best regards,
Bulatmailto:[EMAIL
On Sat, 2007-02-10 at 23:46 +1100, John Ky wrote:
Hi Duncan,
Thanks for your comments. In the context of a haskell process running
as a Windows service, a message box is useless, because Haskell
services do not have a GUI and cannot interact with the desktop.
Good point. Perhaps you can
Hi
Good point. Perhaps you can persuade the people who look after GHC on
win32 to have it use the Windows debug log service for exception
messages like that when there's no GUI available. Of course if you can
code up and submit such a patch yourself then even better.
Does anyone read that?
On Sun, 2007-02-11 at 17:18 +, Neil Mitchell wrote:
Hi
Good point. Perhaps you can persuade the people who look after GHC on
win32 to have it use the Windows debug log service for exception
messages like that when there's no GUI available. Of course if you can
code up and submit
If you want it fast, don't use a sieve method at all (or a wheel method) - use
trial division:
primes = 2 : [p | p - [3,5..], trialDivision primes p]
trialDivision (p:ps) n | r == 0= False
| q p = True
| otherwise = trialDivision ps n
Donald Bruce Stewart wrote:
The following C program was described on #haskell
#include stdio.h
int main()
{
double x = 1.0/3.0;
double y = 3.0;
int i= 1;
for (; i=10; i++) {
x = x*y/3.0;
y = x*9.0;
}
Yes, and that's pretty much what my version does (and what the
original tried to do?).
On Feb 11, 2007, at 20:14 , DavidA wrote:
If you want it fast, don't use a sieve method at all (or a wheel
method) - use
trial division:
primes = 2 : [p | p - [3,5..], trialDivision primes p]
Rafael Almeida [EMAIL PROTECTED] writes:
I've always found the following definition of the sieve of eratosthenes
the clearest definition one could write:
sieve [] = []
sieve (x:xs) = x : sieve [y | y - xs, y `mod` x /= 0]
It doesn't perform better than Augustsson's solution. It does
Hi Paul,
Can I have your code that doesn't work? I want to fiddle with it a bit.
Thanks
-John
On 2/12/07, Paul Moore [EMAIL PROTECTED] wrote:
On 09/02/07, Paul Moore [EMAIL PROTECTED] wrote:
It probably wouldn't be hard to write a reasonably general wrapper for
this, but it's a bit late
On 2/10/07, Matthew Brecknell [EMAIL PROTECTED] wrote:
Rafael Almeida said:
I've always found the following definition of the sieve of eratosthenes
the clearest definition one could write:
sieve [] = []
sieve (x:xs) = x : sieve [y | y - xs, y `mod` x /= 0]
It doesn't perform better than
I hope the following doesn't come across as
condescending...
The recent issue of The Monad Reader has generated
some excitement, mostly to do with the time travel
article. I, however, would like to discuss a simpler
solution to implementing dropWhile with foldr, which
is discussed in the first
I wrote:
primes :: [Int]
primes = 2 : filter isPrime [3,5..] where
f x p r = x p*p || mod x p /= 0 r
isPrime x = foldr (f x) True primes
Creighton Hogg wrote:
This looks really slick to me, thanks.
So if I understand correctly, the main thing that makes this work is that
'ing the
It has been already remarked that any algorithm of finding prime
numbers that uses division or `mod` operations cannot be called
(Eratosthenes) sieve. The insight of Eratosthenes is finding primes
without resorting to division or multiplication. In his time, doing
either of those operations was
Hi all,
I am trying to get a deeper understanding of core's role in GHC and
the compilation of functional languages in general. So far I have
been through
- The hackathon videos,
- A transformation-based optimiser for Haskell,
- An External Representation for the GHC Core Language
I think gcc 4.x have much better optimizations than 3.x since SSA added.I
donot know if there are very good IR for functional language optimization. Is
it hard for STG language to analysis this kind of code? go !x !y !i
| i == 10 = printf %f\n (x+y)
| otherwise
On Mon, Feb 12, 2007 at 04:45:47PM +1100, Matt Roberts wrote:
Hi all,
I am trying to get a deeper understanding of core's role in GHC and
the compilation of functional languages in general. So far I have
been through
- The hackathon videos,
- A transformation-based optimiser for
There is:
http://jparsec.codehaus.org/
HTH,
--
OQube software engineering \ génie logiciel
Arnaud Bailly, Dr.
\web http://www.oqube.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
22 matches
Mail list logo
