I am preparing to embark on some serious cluster oriented coding (high
availability, monitoring, failover, etc). My primary concern is
conforming to standards. I would also like to aid any existing project
that fall under this scope. HackPar seems currently targeted towards
HPC style clustering, b
On Fri, Dec 4, 2009 at 4:25 PM, Casey Hawthorne wrote:
> Are there major inefficiencies in Haskell compared to OCaml?
> If so, can something be done about them?
>
There are definitely some gotchas when it comes to performance, mostly in
the realm of inadvertent space leaks and such.
But that's
16, 2009 at 12:29 PM, Rick R wrote:
> There is language.c
>
> http://www.sivity.net/projects/language.c/
> http://hackage.haskell.org/package/language-c
>
>
> From a parsing standpoint, C++ is a massive departure from C. Good luck
> though.
>
>
> On Thu, Jul 16, 20
There is language.c
http://www.sivity.net/projects/language.c/
http://hackage.haskell.org/package/language-c
>From a parsing standpoint, C++ is a massive departure from C. Good luck
though.
On Thu, Jul 16, 2009 at 12:25 PM, Roy Lowrance wrote:
> I am working on a research language that is a v
IMO, causing a segfault in the interpreter is more than just a DOS
vulnerability :)
On Thu, Jul 9, 2009 at 6:11 PM, Derek Elkins wrote:
> On Thu, Jul 9, 2009 at 12:31 PM, Jason Dagit wrote:
> >
> >
> > On Thu, Jul 9, 2009 at 10:00 AM, Thomas ten Cate
> wrote:
> >>
> >> By the way, the most valua
I think it would be best if the page were targeted towards newcomers, and
not as a jump point for resources.
Such a jump page is useful, but not as a homepage. Perhaps
haskell.org/linkswould be a better place for such a thing.
As an aside, in the current homepage, the Haskell description is outwe
It has to do with treating groups of records from a table like an object.
You have the object Employee, which consists of rows from the Person table,
the Account table and the Building table.
When you instantiate the object. if you don't ask to view the Employee's
building information, it doesn't b
e work has been done on JVM - iirc, Don Stewart did some work
> back in the day,
> www.cse.unsw.edu.au/~pls/thesis/dons-thesis.ps.gz<http://www.cse.unsw.edu.au/%7Epls/thesis/dons-thesis.ps.gz>,
> but I'm not sure how comprehensive it is.
>
> Is anyone else interested in
This is definitely good news!
So... who's doing the Android/JVM target? ;)
On Mon, Jun 22, 2009 at 7:37 PM, Daniel Peebles wrote:
> How exciting! I fully support the creation of a new mailing list about
> iphone+haskell :)
>
> On Mon, Jun 22, 2009 at 6:30 PM, Ryan Trinkle wrote:
> > Dear Has
They are the creators of Thrift which they created for internal use and then
published/open-sourced.. It is a multi-language RPC API/Service. When it
went public, one of the languages interfaces they provided was Haskell. So
yes. They use Haskell somewhere inside Facebook.
On Wed, May 27, 2009 at
I really like the idea of the region based mem management (and other GC
options) in JHC. It could potentially remove the need for any runtime at
all, which is nice.
Two fundamental differences of Timber is that it is purely strict, and not
pure functional.
This makes the implementation and use of
You may wish to look at Timber. It is a Haskell descendant designed for
embedded systems.
Its current default output is C which is then compiled. It is a very young
language, but given the current list of use cases, I am sure that it will
never abandon it's C output model, because most people in em
It depends on the underlying file control used by ghc. if it's the FILE
stream pointer, some implementations suffer from a 255 file limit. If it's a
standard file descriptor (open instead of fopen), then it's limited by
ulimit.
On Sun, Apr 5, 2009 at 10:35 AM, Jason Dusek wrote:
> Oh, curses. I
You could profile your app for memory usage. Then you could figure out just
what function is blowing up the mem usage and figure out how to optimize it.
http://book.realworldhaskell.org/read/profiling-and-optimization.html
2009/4/2
> I'm relatively new to haskell so as one does, I am rewritin
6 AM, John Meacham wrote:
> On Mon, Mar 23, 2009 at 07:00:26PM -0400, Rick R wrote:
> > The agreement doesn't specifically prohibit the use of interpreters (just
> > those than run external code). It also doesn't say anything about machine
> > generated code. The only t
I've been messing with Haskell since the Middle of January on evenings and
weekends. Just now I'm getting to the point where I can construct nontrivial
programs with little help from #haskell.
It is by no means my most proficient language, I've been coding C++ and
other languages for over 10 year
This is solely the reason for my interest in JHC.
The agreement doesn't specifically prohibit the use of interpreters (just
those than run external code). It also doesn't say anything about machine
generated code. The only thing one would have to ensure is that the
dependencies of JHC are all comp
Unfortunately the developers agreement expressly forbids the use of
interpreters that load and run external programs. This is probably for the
simple reason that it would be almost impossible to secure, or even
guarantee that it wont exceed its space and mem usage bounds required by
AppStore apps.
but the rest of it looks like a fat lady bending over.
2009/3/21 Henning Thielemann
>
> On Fri, 20 Mar 2009, Jon Fairbairn wrote:
>
> ::Haskell
>>
>
> See the lamp in logo 33 at
> http://www.haskell.org/logos/poll.html
>
> ___
> Haskell-Cafe mailing
Actually, yea. This is pretty nice. If either #9, #49 or #50 make it to
the top of the list, can we ensure that this will be selectable as a
variant?
(If not, we can at least put it on cafe press and I'd buy the t-shirt :) )
2009/3/19 Edward Kmett
> Ooh, shiny!
>
> 2009/3/19 Warren Harris
>
QED
2009/3/17 Daniel Schüssler
> (correction of the example)
>
> (105: ) (106: A) (107: X,B) (108: C,D) (109: E ) (110: )
>
> moving down X will result in either
>
> (105: A) (106: B) (107: X ) (108: C,D) (109: E ) (110: )
>
> or equivalently
>
> (105: ) (106: A) (107: B ) (108: X ) (10
And we thought butterfly ballots were bad.
I just went through the logo page and wrote down my favorite 20 logos in one
column, and gave them a rank in the other. Then translated that into the
voting list using the combo boxes (not the buttons). The total process took
20 minutes.
I am on FF3 on
I have basic beginning to a parser for the BSON spec:
http://www.mongodb.org/display/DOCS/BSON
It is basically a binary compressed form of JSON.
The usage model should be general, but I intend to read this data over TCP.
Currently my system is quite inefficient, I convert leading bytes to Int
then
Where can I find more information on STGs? Google search doesn't bring up
anything too enlightening.
My curiosity was piqued by http://www.cs.chalmers.se/~gedell/ssc/index.html.
Of course it doesn't indicate how these should be built or the format.
On Sun, Mar 8, 2009 at 6:41 PM, Loup Vaillant w
http://en.wikibooks.org/wiki/Write_Yourself_a_Scheme_in_48_Hours
Not sure if this is exactly what you want, but you could certainly fufill
all of your requirements using this as a baseline. Instead of evaluating the
actual statements in your eval function, you could simply render them to C.
As fa
I agree. A distributed database could be made as usable as a standard
RDBMS by offering an interface by which you supply a map/reduce pair
of functions and a list (range?) of keys.
This could be easily implemented with a database such as Scalaris, in
which the Chord algorithm is responsible for pl
have a few more rigged elections before we see any deliverables from
Coyotos.
On Thu, Feb 19, 2009 at 2:45 AM, Ketil Malde wrote:
> Rick R writes:
>
> > I'm sure Premier Election Solutions (formerly Diebold) can provide us
> with
> > an online voting solution.
>
&
I.e. war, plague.famine. etc.
>
> gregg reynolds wrote:
>
> >But what about the side effects?
> >
> >Rick R wrote:
> >
> >>I'm sure Premier Election Solutions (formerly Diebold) can provide us
> with
> >>an online voting solution.
> >
I'm sure Premier Election Solutions (formerly Diebold) can provide us with
an online voting solution.
Their value-add services allows us to set the outcome beforehand, so, in
effect, the the voting process will be determinate. Which is certainly of
interest to Haskell coders.
On Wed, Feb 18, 2009
I have been learning Haskell for the last two weeks and was relaying that
exact benefit to my friend in attempts to convert him. I spend 3 hours
getting a few functions to compile, but when they do, they just work. Every
time.
2009/2/14 Peter Verswyvelen
> One of the things I liked a lot when wo
Cairo is now the graphics back end for Firefox, yes? I thought moving to
Cairo resulted in a considerable rendering speedup for FF.
On Fri, Jan 30, 2009 at 6:31 PM, Peter Verswyvelen wrote:
> I found Cairo rather slow, even on the fastest hardware.
>
> Maybe OpenVG will take off one day:
> http:/
I haven't really thought about GUIs much in the last decade, but if one were
to embark on such an endeavor, I think an appropriate starting point would
be SDL with OpenGL.
There would be no very little API structure to hinder the pure functional
approach, and it would be portable to a wide variety
On Tue, Jan 27, 2009 at 3:05 PM, Michaeljohn Clement wrote:
> John A. De Goes wrote:
>
...
> There is very little wrong with ECMAScript if people would only
> learn it properly and play to its strengths instead of trying to
> turn it into things it is not.
>
> Treating ECMAScript as a compiler tar
33 matches
Mail list logo
