Hi,
There is a workshop on Functional Programming and also
a conference on programming languages
http://babel.ls.fi.upm.es/tpf2013/cfp_english.txt
If interested, you can contact the organizers...
Regards,
Salvador.
El 06/09/13 22:59, Joachim Breitner escribió:
Hi,
I'll be visiting
structures (like the binary
search tree) the simpler expression is really desirable. Can a really
smart compiler transform/optimize the first definition into something
that traverses the data structure only once? Can GHC?
- Lucas
___
Haskell-Cafe mailing list
Hi Francisco,
You can try GitHub's code search
https://github.com/search?l=Haskellq=mvarref=cmdformtype=Code
Cheers,
--Lucas
2013/6/12 Francisco M. Soares Nt. xfrancisco.soa...@gmail.com
Hello, everyone.
I am looking for packages on hackage which use MVars extensively. Those
which create
taste our great fooddrink and everyone can
chat about her favorite programming language. I did this type of
semi-planned dinners a few times with some Ruby folks and it's a good way
to build ties :).
Regards,
--Lucas DiCioccio
___
Haskell-Cafe mailing list
, propose a talk, or read the digest of past meetup(s).
Regards,
--Lucas DiCioccio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Dear Peter,
I recently had a similar problem with the same Haskell Platform version
but on a Macmini (running Lion as well).
I learnt that you have to install the 'command line tools' by using the
'preferences' of your XCode installation. After that, everything will work.
Best regards,
Dear Martin,
I think that the (practical) reason is avoiding equality checks during
pattern matching.
For instance, how do you evaluate this:
foo ((+1):(1+):[])?
Both expressions in the first and second entries of the list are
semantically equivalent,
but from an operational point of
that code, so natually started using parsec.
As a side note, I was reading the I/O section of RWH last night and
came across the lazy vs. strict I/O part, however it didn't occur to
me that Parsec was strict.
Anyway, thanks for all the help and suggestions.
--
Lucas Hazel lu...@die.net.au
code.
Using lazy I/O has reduced run time by 75% and RAM consumption to 3MB
Thank you :)
--
Lucas Hazel lu...@die.net.au
pgpPMNEI3nA3B.pgp
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
FP pants I
don't know what that might be.
--
Lucas Hazel lu...@die.net.au
pgpCpy889Gy8E.pgp
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
version
file
file
...
file
package name
...
From profiling it shows that the memory is simple consumed by reading
in all the lines, the graph from using -p -hd shows an almost Ologn2
growth of the heap as the collection of lines grows.
Is there a better way to do this?
[1] http://crux.nu
--
Lucas
Because both bit0 and bit1 are free *local* variables
within the case expression. So, they have nothing
to do with your defined functions bit0 and bit1.
Best regards,
Salvador.
[EMAIL PROTECTED] wrote:
Can a kind soul please enlighten me on why f bit0 and f bit1
both return 0?
bit0 =
12 matches
Mail list logo