Ivan Lazar Miljenovic wrote:
C K Kashyap wrote:
I've come across this a few times - In Haskell, once can prove the
correctness of the code - Is this true?
I'm not quite sure where you got that...
But since Haskell is pure, we can also do equational reasoning, etc.
to help prove correctness.
Hi,
monad-embed is an experimental programming language that parameterizes
everything on a monad by default. Examples, source code, etc. are at
http://timmaxwell.org/pages/monad-embed/.
I posted about it on the Haskell subreddit a few months ago (see
http://bit.ly/cUZvrB) but I was advised to
Some of us interested in Haskell GameDev have formed chat room Haskellers
Interest Group, you can out find more info here. Just spreading the word around.
___
Haskell-Cafe mailing list
I have a small program that fills a file with random numbers. If I
compile it without optimisation, it runs in constant space. And yet, if
I supply -O2 (or even just -O1), for large output files the program
gobbles large amounts of RAM.
Is this a known bug? (GHC 6.10.x)
-- bytestring-trie 0.2.3
A long-awaited release for efficient finite maps from (byte)strings to
values. This version adds a number of new functions for taking advantage
of the trie structure.
At the
On Saturday 12 February 2011 11:30:26, Andrew Coppin wrote:
I have a small program that fills a file with random numbers. If I
compile it without optimisation, it runs in constant space. And yet, if
I supply -O2 (or even just -O1), for large output files the program
gobbles large amounts of
many of the subtleties encountered in the process. I am often 100%
sure of the correctness of my refactors.
While I have an intuitive understanding of what you mean about the
correctness of refactoring ... I personally feel much more comfortable
refactoring Haskell code ... as in - as long
Hi all,
During a little experiment I discovered there is no MonadFix instance available
for the STM monad. Is this absence the consequence of some deep restriction of
how STM works or 'just accidental'? Is there some way I could derive this
instance?
For those who are interested and may know
Hi all,
I just started learning Haskell but am having some trouble getting the
insertion into a binary search tree to
work and was hoping that somebody could advise me on a possible solution.
Thanks.
Given the data type definition of the tree to be:
Code:
data Ord a = BST a = EmptyBST | Node
| v= a = Node a ( insert v b ) c
Hi,
The quoted line is the problem, you wanted to say Node (insert v b) a c.
--
MM
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Saturday 12 February 2011 15:52:29, htc2011 wrote:
Hi all,
I just started learning Haskell but am having some trouble getting the
insertion into a binary search tree to
work and was hoping that somebody could advise me on a possible
solution. Thanks.
Given the data type definition of the
Hello.
How do I make ghc use my installation of MinGW on Windows? I have
ghc-7.0.1 installed and the latest MinGW packages. I want ghc to
automatically find libraries installed by the MinGW installer.
Currently I am getting the error with my application:
Linking Gui.exe ...
C:\Program
Is pkg-config available for MSys? It might help matters if it is - I
think Cabal has direct support for pkg-config.
Otherwise point Cabal to the location of the .a file with
--extra-lib-dirs. You will also have to point to the headers with
--extra-include-dirs.
If you are compiling with GHC
Is there any reason, that one can't find a function that splits a list
at a seperator in the standard library? I imagined something like this:
splitSeperator :: Eq a = a - [a] - [[a]]
splitSeperator ',' foo,bar,baz
-- [foo,bar,baz]
Or something similar? This is needed so often,
Ha, of course -- I feel stupid now hehe. Thanks very much! :-)
On 12 February 2011 15:06, Daniel Fischer [via Haskell]
ml-node+3382792-1536654726-149...@n5.nabble.com wrote:
On Saturday 12 February 2011 15:52:29, htc2011 wrote:
Hi all,
I just started learning Haskell but am having some
On Sat, Feb 12, 2011 at 11:00 AM, Robert Clausecker fuz...@gmail.com wrote:
Is there any reason, that one can't find a function that splits a list
at a seperator in the standard library? I imagined something like this:
splitSeperator :: Eq a = a - [a] - [[a]]
splitSeperator ','
i assume you mean here: http://www.haskell.org/haskellwiki/Game_Development
http://www.haskell.org/haskellwiki/Game_Developmentthe link wasnt in your
orig post i had to google it :P i'm interested to see what you've got
here.
hex
On Sat, Feb 12, 2011 at 4:50 AM, Korcan Hussein
On Sat, Feb 12, 2011 at 6:08 AM, C K Kashyap ckkash...@gmail.com wrote:
Anyway, how can one go about explaining to an imperative programmer with no
FP exposure - what aspect of Haskell makes it easy to refactor?
I think you just said it: typechecking, typechecking, typechecking. In
Haskell, you
On Sat, Feb 12, 2011 at 8:47 AM, Sebastiaan Visser hask...@fvisser.nl wrote:
Hi all,
During a little experiment I discovered there is no MonadFix instance
available for the STM monad. Is this absence the consequence of some deep
restriction of how STM works or 'just accidental'? Is there
On Sat, 12 Feb 2011 16:12:22 +0100, José Romildo Malaquias
j.romi...@gmail.com wrote:
Hello.
How do I make ghc use my installation of MinGW on Windows? I have
ghc-7.0.1 installed and the latest MinGW packages. I want ghc to
automatically find libraries installed by the MinGW installer.
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
Aaron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 12 February 2011 21:18, Aaron Gray aaronngray.li...@gmail.com wrote:
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
http://blog.johantibell.com/2010/08/results-from-state-of-haskell-2010.html
aaronngray.lists:
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
No one knows. There are many figures that you could use to estimate the
size (e.g. I try to gather signifcant stats in yearly reports about
Hackage)
* In 2010, for example,
On 12 February 2011 20:24, Don Stewart d...@galois.com wrote:
aaronngray.lists:
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
No one knows. There are many figures that you could use to estimate the
size (e.g. I try to gather signifcant
I am very pleased to announce that Hac phi 3, third in an annual
series of Haskell hackathons hosted at the University of Pennsylvania
in Philadelphia, will take place from July 29-31. More details will
be forthcoming, but put it on your calendar now. The past two years
have been a blast -- you
Aaron Gray wrote:
On 12 February 2011 20:24, Don Stewart d...@galois.com wrote:
aaronngray.lists:
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
No one knows. There are many figures that you could use to estimate the
size (e.g.
On Sat, Feb 12, 2011 at 01:12:22PM -0200, José Romildo Malaquias wrote:
Hello.
How do I make ghc use my installation of MinGW on Windows? I have
ghc-7.0.1 installed and the latest MinGW packages. I want ghc to
automatically find libraries installed by the MinGW installer.
Currently I am
On 12 February 2011 21:31, Erik de Castro Lopo mle...@mega-nerd.com wrote:
Aaron Gray wrote:
On 12 February 2011 20:24, Don Stewart d...@galois.com wrote:
aaronngray.lists:
I was wondering if anyone had an idea or estimate as to how large
the
Haskell community is ?
aaronngray.lists:
Then there are people who download it, look at it and maybe find it too
complex to use ?�
I am wondering if mailing list statistics would be the best guide ?
Many people don't subscribe to the mailing list, and instead read it on
gmane, or google, or reddit, or
Aaron Gray wrote:
I am wondering if mailing list statistics would be the best guide ?
I am the organiser of FP-Syd, the Sydney (Australia) functiona prgramming
group.
Of the people who are regaular attendees to FP-Syed meetings, who say
they are haskell users, I have seen less than 50% of
On 02/12/2011 02:22 PM, Christopher Done wrote:
IRC channel has 600~ users in at any one time.
At this moment it has 720! And this seems to be roughly the norm recently.
- Jake McArthur
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 13/02/11 08:37, Erik de Castro Lopo wrote:
Aaron Gray wrote:
I am wondering if mailing list statistics would be the best guide
?
I am the organiser of FP-Syd, the Sydney (Australia) functiona
prgramming group.
Of the people who are
On 12.02.2011, at 21:18, Aaron Gray wrote:
I was wondering if anyone had an idea or estimate as to how large
the Haskell community is ?
All the answers made me wonder what the criterion is to be a member of
the Haskell community. Are you a member if you downloaded ghc, if you
have (at
On 12 February 2011 23:57, Jan Christiansen j...@informatik.uni-kiel.dewrote:
On 12.02.2011, at 21:18, Aaron Gray wrote:
I was wondering if anyone had an idea or estimate as to how large the
Haskell community is ?
All the answers made me wonder what the criterion is to be a member of the
On Sat, Feb 12, 2011 at 10:52 PM, Aaron Gray aaronngray.li...@gmail.com wrote:
Maybe we should have some website like the Linux Counter where you can get
an official Haskell user number ?
Then advertise it well.
We already have haskellers.com, almost there. =)
--
Felipe.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 2/11/11 06:06 , C K Kashyap wrote:
I've come across this a few times - In Haskell, once can prove the
correctness of the code - Is this true?
Only up to a point. While most of the responses so far focus on the
question from one direction, the
Hi!
How could I convince lhs2tex to add in poly mode line numbers before
each code line in code block?
Mitar
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 2/11/11 14:20 , Cristiano Paris wrote:
God! It seems like I'm reading the small-character lines of a contract :)
Wait until you encounter the equivalent of rules-lawyering in the type system :)
- --
brandon s. allbery
38 matches
Mail list logo
