On Mon, 20 Dec 2010, Ivan Lazar Miljenovic wrote:
On 20 December 2010 06:43, Henning Thielemann
lemm...@henning-thielemann.de wrote:
Maybe it's referring to (or you could use) one of the following:
* http://hackage.haskell.org/package/EnumContainers
*
On 11/30/10 16:46, Stephen Tetley wrote:
Andy Gill developed HERA which sounds somewhat similar to what you are
asking, but I don't know that it would be particularly beginner
friendly and I think it was static - i.e. the reduction rules were
applied to program source code rather than within
Hello Haskellers,
I'm playing a bit with Data.Judy. However, I noticed that using StablePtr
incurs in some performance problems, I don't have any numbers but as a
example use Int and ByteString as values and you can notice the difference
without any benchmarking tool with the example that comes
On Sun, Dec 19, 2010 at 5:01 PM, Duncan Coutts duncan.cou...@googlemail.com
wrote:
On 19 December 2010 17:44, Greg Weber g...@gregweber.info wrote:
Michael Snoyman and I were discussing the need for beta releases of Yesod
and he encourage me to post this to the cafe. Beta releases could be
Pointers are mapped to StablePtrs using *drumroll* a hash table,
so you can give up on getting acceptable performance out of this
combination IMO.
G
On Mon, Dec 20, 2010 at 5:06 PM, Diego Souza dso...@bitforest.org wrote:
Hello Haskellers,
I'm playing a bit with Data.Judy. However, I
Is it possible to implement a REPL (Read-eval-print loop) in Haskell ?
Many thanks in advance,
Aaron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I'm not sure off-hand.. I think it would involve some hackery. How
long do you want to keep support for the old Show format around? If
you just want to convert some data you have right now, then you could
write some code that uses the old Show based code to read in the old
data and write
Hi all,
After many months of hard work, the Snap team is proud to announce
the release of the next major version of the Snap Framework: Snap
0.3.
New Features
- Snap now has SSL support! To enable SSL support, install the
gnutls library and pass the gnutls in when you build
The answer is yes, but could you elaborate? What exactly are you wanting? Do
you want something similar to ghci? Are you wanting to implement a REPL for
some other language in haskell? REPL for haskell, in haskell?
- Job
On Mon, Dec 20, 2010 at 12:47 PM, Aaron Gray
On http://hackage.haskell.org/platform/windows.html , the link for
download haskell for windows is:
http://lambda.galois.com/hp-tmp/2010.2.0.0/HaskellPlatform-2010.2.0.0-setup.exe
Is this normal?
___
Haskell-Cafe mailing list
Any workarounds? Regex is an essential thing for any serious
programming (wow! :). So what should I do?
Thanks
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi!
More information, please :)
(and I'd advise you to rather use regex-tdfa instead - regex-posix is dog slow)
2010/12/20 __kaveh__ kaveh.shahbaz...@gmail.com:
Any workarounds? Regex is an essential thing for any serious
programming (wow! :). So what should I do?
Thanks
Hi Henk-Jan,
thanks for the advice - using hmatrix already worked, but only with simple
matrices. I'll check the dependencies thanks.
Hi Jason,
thanks a lot for the response. Looks like I found a like minded soul. These
links indeed sound very relevent for me.
Thanks and see u around,
On Mon, 20 Dec 2010 19:58:10 +0100, Albert Y. C. Lai tre...@vex.net
wrote:
On http://hackage.haskell.org/platform/windows.html , the link for
download haskell for windows is:
http://lambda.galois.com/hp-tmp/2010.2.0.0/HaskellPlatform-2010.2.0.0-setup.exe
Is this normal?
If you mean:
I think broken posix-regex is a known issue with the last release of
the Platform on Windows.
Although I haven't tried myself, I think it can be fixed by upgrading
with cabal - although regex-posix is a FFI binding, in this case all
the parts (headers and C library) are bundled with the platform
On 20 December 2010 21:24, Stephen Tetley stephen.tet...@gmail.com wrote:
Although I haven't tried myself, I think it can be fixed by upgrading
with cabal - [SNIP]
To be explicit - that's upgrading just regex-posix with Cabal not the
whole Platform.
You might want to look at Malcolm Wallace's HMake - there is both the
code and a paper describing it. Quoting the paper:
hi - hmake interactive - is a small program, itself written in
Haskell, which imitates many of the interactive features of Hugs.
On http://hackage.haskell.org/platform/windows.html , the link for
download haskell for windows is:
http://lambda.galois.com/hp-tmp/2010.2.0.0/HaskellPlatform-2010.2.0.0-setup.exe
Is this normal?
After some URL guessing the following link works for me:
On 10-12-20 04:14 PM, Henk-Jan van Tuyl wrote:
On Mon, 20 Dec 2010 19:58:10 +0100, Albert Y. C. Lai tre...@vex.net
wrote:
On http://hackage.haskell.org/platform/windows.html , the link for
download haskell for windows is:
Hi all,
In Matlab the following line of code:
V3 = V1.*(V20)
(V20) gives a Bool-Vector with ones (trues) and zero's where elements
of V2 are 0; Then this Bool vector is used to multiply all elements in V1
to zero
where the condition V20 is not fulfilled.
How can I do that in Haskell ? (I
I've been reviewing the library, and have come unstuck with the *id*function.
What's its purpose and can someone give me an example of its practical use.
--
Andrew
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, 20 Dec 2010, gutti wrote:
In Matlab the following line of code:
V3 = V1.*(V20)
What you certainly need is a zipWith function on matrices that lets you
write
Matrix.zipWith (\a1 a2 - if a20 then a1 else 0) v1 v2
I can't see such a function in Matrix, but in Vector
It does precisely what you'd think. It returns the value passed in.
It's mainly used in cases where a higher-order function expects a
function, but you don't want to modify anything. See for instance
http://www.haskell.org/ghc/docs/7.0-latest/html/libraries/base-4.3.0.0/Data-Maybe.html#v:maybe
If
Galois is happy to announce cabal-dev: a tool for managing development
builds of Haskell projects within sandboxes.
Performing consistent builds is critical in software development, but
the current system in GHC/Haskell of per-user and per-system GHC package
databases interferes with this need
On Tue, Nov 2, 2010 at 11:02 AM, Claus Reinke claus.rei...@talk21.com wrote:
I often find myself writing example code that I'd like
to distribute via cabal, but without further burdening
hackage with not generally useful packages.
1. The simplest approach would be if cabal could expose
its
Thanks; but as in 1st post cabal update and install does not work and
have some strange issues like: it shows that the new version is
installed; but the old version is still in use and new version is also
in a new directory other that Haskell platform directory.
Did you check haskellers.com?
If you come down south there's a decent group here in Singapore.
Max
On Dec 1, 2010, at 4:58 AM, Pasqualino Titto Assini wrote:
Hello,
I am going to Taiwan with my family for about five weeks (I am
Italian, my wife is Taiwanese and we have two kids) and I
I've been reviewing the library, and have come unstuck with the *id*function.
What's its purpose and can someone give me an example of its practical use.
It's purpose is simply to be the identity function. The type says exactly
what it does.
Prelude :t id
id :: a - a
It's often useful in
28 matches
Mail list logo
