Jake McArthur wrote:
staafmeister wrote:
Yes I know but there are a lot of problems requiring O(1) array updates
so then you are stuck with IO again
Or use ST. Or use IntMap (which is O(log n), but n is going to max out
on the integer size for your architecture, so it's really just O(32) or
There are also the judy arrays
http://hackage.haskell.org/package/HsJudy
http://hackage.haskell.org/package/judy
dons recently advertised the latter as being 2x faster than IntMap,
but I don't know in what respect these two packages differ and why Don
decided to create 'judy' despite the
Joe Fredette wrote:
I fiddled with my previous idea -- the NatTrans class -- a bit, the results
are here[1], I don't know enough really to know if I got the NT law
right, or
even if the class defn is right.
Any thoughts? Am I doing this right/wrong/inbetween? Is there any use
for a class
On Wed, Oct 14, 2009 at 11:06 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Andrew,
Thursday, October 15, 2009, 12:54:37 AM, you wrote:
Does anybody actually get paid to develop GHC? Or is this all people
SPJ, SM and Ian are paid by MS Research. Other people involved in core
Uwe Hollerbach wrote:
Yes, I've looked at that and am thinking about it. I'm not quite
certain it's needed in my real program... I seem to have convinced
myself that if I actually specify a proper set of unique prefixes, ie,
set the required lengths for both frito and fromage to 3 in the
test
It's a poor error message, but GHC's entire handling of impredicative
polymorphism is poor at the moment. Indeed, I'm seriously considering removing
it altogether until we can come up with a more robust story. (So don't rely on
it!)
The error happens because you are trying to use the type
See our previous discussion on this topic here:
http://www.nabble.com/Fwd:-Unification-for-rank-N-types-td23942179.html
Thanks,
Vladimir
On Wed, Oct 14, 2009 at 10:35 PM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Dear café,
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE
At Thu, 15 Oct 2009 10:15:46 +0400,
Eugene Kirpichov wrote:
but I don't know in what respect these two packages differ and why Don
decided to create 'judy' despite the existence of HsJudy.
HsJudy doesn't compile against the latest judy library (as Don knew) -
presumably he had a good reason to
I found the HsASA library [1] on Hackage, but there's no documentation
and it's not particularly intuitive. I can't see any obvious way of
choosing initial config or generating new configurations. Google
reveals no one using it. Does anyone have ideas?
[1]:
Hi all,
has anybody already developed an EDSL for relational algebra?
HaskellDB does that, but its current implementation only allows for
generating SQL, are there other implementations?
Günther
___
Haskell-Cafe mailing list
2009/10/15 Dougal Stanton dou...@dougalstanton.net:
I found the HsASA library [1] on Hackage, but there's no documentation
and it's not particularly intuitive. I can't see any obvious way of
choosing initial config or generating new configurations. Google
reveals no one using it. Does anyone
Hello,
I am glad to announce next release of hs-ffmpeg library. Now you could
download it from the Hackage along with the ffmpeg-tutorials, which show
capabilities of this library.
The installation process is a bit tricky now, so welcome to my blog post
Hi, all, thanks for the further inputs, all good stuff to think
about... although it's going to be a little while before I can
appreciate the inner beauty of Doaitse's version! :-) I had considered
the approach of doing a post-parsec verification, but decided I wanted
to keep it all inside the
(sorry for the slow reply on this topic...)
Robert Atkey and Oleg presented some very interesting code in response
to your query. But some of you might (and should!) be asking why on
earth did Jacques use unsafePerformIO?, especially when neither Robert
nor Oleg did.
Simply put: I answered
has anybody already developed an EDSL for relational algebra?
HaskellDB does that, but its current implementation only allows for
generating SQL, are there other implementations?
Hello Günther,
Ganesh did something called squiggle a while ago:
http://code.haskell.org/squiggle/unstable/
I've
Hi Alistair,
Both of our projects just generate SQL though, AFAIK. Was there
something else you wanted to generate?
I wish I could provide a clear answer to that myself, truth is I'm not
certain myself at the moment.
All this is related to a rl problem I have, it concerns the business
Hi Jacques,
thank you again for your post, better late than never :)!
Let me first apologize to you, I did not immediately recognize you as one
of the authors of the Finally Tagless paper.
After 2 years now of using haskell at a mere layman's level and
nevertheless writing better and more
Just a short note to show how the 3 evaluation orders can be written in
a very symmetric manner:
o...@okmij.org wrote these as:
In call-by-name, we have
lam f = S . return $ (unS . f . S)
In call-by-value, we have
lam f = S . return $ (\x - x = unS . f . S . return)
In
For now, I've given up on cheap hosting (via statically compiled CGI).
I've created a GHC 6.10.4, cabal-install, Ubuntu 9.04 ec2 instance +
MySQL and it works well.
Running this plus EBS and Elastic IP will run a little over $60 a month. Ouch.
The work going into Haskell Platform is amazing,
I've run Haskell stuff on VPS hosts like Linode or SliceHost. $20/month is a
lot better than $60.
On Thu, Oct 15, 2009 at 12:32 PM, Austin King sh...@ozten.com wrote:
For now, I've given up on cheap hosting (via statically compiled CGI).
I've created a GHC 6.10.4, cabal-install, Ubuntu 9.04
On Thu, Oct 15, 2009 at 10:11 AM, John Van Enk vane...@gmail.com wrote:
I've run Haskell stuff on VPS hosts like Linode or SliceHost. $20/month is
a lot better than $60.
lambdabot is currently hosted on the lowest end linode. The biggest hurdle I
hit was that gnu ld is a memory pig when GHC
Don Stewart wrote:
bulat.ziganshin:
Hello Andrew,
Thursday, October 15, 2009, 12:54:37 AM, you wrote:
Does anybody actually get paid to develop GHC? Or is this all people
SPJ, SM and Ian are paid by MS Research. Other people involved in core
development are mainly scientists
Well-Typed is in the UK too :)
On Thu, Oct 15, 2009 at 1:52 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Don Stewart wrote:
bulat.ziganshin:
Hello Andrew,
Thursday, October 15, 2009, 12:54:37 AM, you wrote:
Does anybody actually get paid to develop GHC? Or is this all people
Daniel Peebles wrote:
Well-Typed is in the UK too :)
Really? Cool! I wonder where... Oh, Oxford. So also not far from me.
However, given that I can't even construct a simple sentence correctly...
On Thu, Oct 15, 2009 at 1:52 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
lambdabot is currently hosted on the lowest end linode. The biggest hurdle I
[...]
+1. I use linode for (most of) my Haskell work.
John
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I have implemented reverse dependencies in Hackage. You can play with
the demo here:
http://bifunctor.homelinux.net/~roel/hackage
I already send a message to Haskell-Cafe, but I made a few changes and
would like some feedback. You can sort the tables of reverse
dependencies by clicking
Hi,
This is really neat.
2009/10/15 Roel van Dijk vandijk.r...@gmail.com:
Things I would like feedback on:
- Rev. deps overview for all packages; is it useful?
Yes.
- If you look at the reverse dependencies for a package like digest
you'll see a list of packages that depend on digest. Next
2009/10/15 Johan Tibell johan.tib...@gmail.com:
- Is this the best way to present the information?
Are the packages with all zeroes in the columns still reverse
dependencies (that don't have any dependencies in turn)?
Yes. They are reverse dependencies which have no reverse dependencies
of
{-# LANGUAGE EmptyDataDecls #-}
module Main (main) where
import Unsafe.Coerce
data Anything
newtype Key x = Key Int deriving Eq
type Dict = [(Key Anything, Anything)]
put :: Key x - x - Dict - Dict
put k' v' = raw (unsafeCoerce k') (unsafeCoerce v')
where
raw k0 v0 [] = [(k0,v0)]
raw
On Thu, 8 Oct 2009, Michael Mossey wrote:
I wrote some code to model the keystroke-to-keystroke delay in a person
typing, with pseudorandomness. There are two kinds of delays.. one is a
very small delay as the person reaches for a new key (call this 'reach'
delays), the other is a larger delay
It looks like you may want
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Dynamic.html
. It does more or less what you're talking about behind the scenes,
but probably uses the magical Any type to not encounter issues with
functions, and gives you a Nothing if you attempt to
On 15 okt 2009, at 16:58, Uwe Hollerbach wrote:
Hi, all, thanks for the further inputs, all good stuff to think
about... although it's going to be a little while before I can
appreciate the inner beauty of Doaitse's version! :-)
The nice thing is that you do not have to understand the inner
You can sort the tables of reverse dependencies by clicking on
the column headers.
I wouldn't have thought about clicking in the columns headers.
Maybe you could show the order arrow already in the beggining,
before any clicks, this would give a hint.
- Rev. deps overview for all packages;
Nathan P. Campos wrote:
Hello,
I'm very new at Haskell, i'm reading a book and starting, but i want to
know which is the best editor for development under Windows, because now
i'm using Notepad++(That i use to develop in C++).
Thanks,
Nathan Paullino Campos
If you use emacs,
I'm very new at Haskell, i'm reading a book and starting, but i want to
know which is the best editor for development under Windows, because now
i'm using Notepad++(That i use to develop in C++).
The best editor for development is Emacs, of course.
http://www.gnu.org/software/emacs
Hello!
On Thu, Oct 15, 2009 at 8:10 PM, Stefan Monnier
monn...@iro.umontreal.ca wrote:
I'm very new at Haskell, i'm reading a book and starting, but i want to
know which is the best editor for development under Windows, because now
i'm using Notepad++(That i use to develop in C++).
The best
In my humble opinion, one of the best editors for development of all
time is Leo:
http://webpages.charter.net/edreamleo/front.html
Leo takes the idea of code folding and gives you complete control
over it. That is, unlike other editors which only let you fold the
code inside
The only thing I haven't figured out is how to do tab-completion of
words in the ghci buffer. Do I need to use a different key
combination? I couldn't find that in the documentation.
I think it's just a missing feature.
Stefan
___
-- Forwarded message --
From: Ravi Nanavati rav...@alum.mit.edu
Date: Thu, Oct 15, 2009 at 11:07 PM
Subject: [BostonHaskell] Next meeting: October 21st at MIT (32G-882)
To: bostonhask...@googlegroups.com
I'm pleased to announce the October meeting of the Boston Area Haskell
It is pretty amazing what such a small coterie of devs has
accomplished in GHC. Compare this to the thousands that work on GCC/
javac/csc and vis studio etc. So, once again, kudos.
max
On Oct 16, 2009, at 2:30 AM, Andrew Coppin wrote:
Daniel Peebles wrote:
Well-Typed is in the UK too :)
Maybe you would like the hetero-map package. Its purpose is to do
precisely what you are doing, but in a typesafe way.
On Thu, Oct 15, 2009 at 3:10 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
{-# LANGUAGE EmptyDataDecls #-}
module Main (main) where
import Unsafe.Coerce
data
41 matches
Mail list logo
