On Fri, Apr 9, 2010 at 4:35 AM, Mark Lentczner wrote:
>
> On Apr 8, 2010, at 6:55 PM, ViaToR (Alvaro V.) wrote:
>
>> I just finished writing my GSoC proposal ...
>>
>> The project is about creating a new documentation tool for Haskell
>> projects,...
>
> I've taken a brief look and this looks lov
DavidA wrote:
> I am having difficulty debugging a troublesome stack overflow, which I
> think might be related to calling unsafePerformIO from within the IO
> monad.
>
> [...]
>
> f x = unsafePerformIO $ do
> m <- randomRIO (1,2)
> return (m+x)
As a side note you don't need unsafePerfor
Hi.
I wrote a(nother) SoC proposal for studying LLVM performance, compared with the
Native Code Generator back-end. It's available at:
http://www2.dcc.ufmg.br/laboratorios/llp/wiki/doku.php?id=marco_soc2
I know the deadline is now near, but I'd be happy to hear comments about it
and update it b
On Thu, Apr 8, 2010 at 10:58 PM, Antoine Latter wrote:
> One thing in the branch over in http://code.haskell.org/hackage-server
> is the ability for package maintainers to upload documentation to the
> server. This way we're not tying the ability of the server doing a
> build-check to the ability
On Thu, Apr 8, 2010 at 6:38 PM, Matthew Gruen wrote:
> On Wed, Apr 7, 2010 at 9:02 AM, Maciej Piechotka
> wrote:
>> I guess 'works also with B in version X.Y.Z' is also. Most of the above
>> changes should not be IMHO in cabal (sorry for answering PS here).
>> Especially 'not maintained anymore'
My thanks to all of you for your help! I've submitted my proposal as
of this afternoon. I've done my best to ensure that the fruits of
this discussion are represented there.
As an aside, the Google's form has seriously mangled my formatting; if
anyone here has past experience and/or pointers, I'
On Apr 8, 2010, at 6:55 PM, ViaToR (Alvaro V.) wrote:
> I just finished writing my GSoC proposal ...
>
> The project is about creating a new documentation tool for Haskell
> projects,...
I've taken a brief look and this looks lovely. I'm currently deep at work on
re-coding the Haddock backend
On Thu, Apr 8, 2010 at 5:53 AM, Duncan Coutts
wrote:
>
> I think it's important to be able to convert into standard or custom
> formats. I've no idea if JUnit XML would make sense as the native
> format. It's plausible.
>
I hadn't really thought about cabal, itself, being a consumer for test
resu
--- On Thu, 4/8/10, Gregory Crosswhite wrote:
> From: Gregory Crosswhite
>
> On a tangental note, I've considered coding up a package
> with an "AlmostEq" typeclass that allows one to test for
> approximate equality. The problem is that different
> situations call for different tolerances so
On Thu, Apr 8, 2010 at 8:51 PM, Gregory Crosswhite
wrote:
> First of all, it isn't clear to me that NaN /= NaN, since in ghci the
> expression "1.0/0.0 == 1.0/0.0" evaluates to True. But even if that were the
> case, I would call that more of a technicality then meaning that equality is
> not
Hi!
I finish writing my proposal (maybe a bit too late).
I would be glad to read any feedback.
http://socghop.appspot.com/gsoc/student_proposal/show/google/gsoc2010/diegoeche/t127067573658
Best Regards,
Diego Echeverri
___
Haskell-Cafe mailing list
Has
On Apr 8, 2010, at 6:53 PM, Daniel Fischer wrote:
> Am Freitag 09 April 2010 02:51:23 schrieb Gregory Crosswhite:
>
> Yes, but 1/0 isn't a NaN:
>
> Prelude> isNaN (1.0/0.0)
> False
> Prelude> isNaN (0.0/0.0)
> True
> Prelude> 1.0/0.0
> Infinity
> Prelude> 0.0/0.0
> NaN
> Prelude> (0.0/0.0) == (
Hello,
I just finished writing my GSoC proposal and I want to have some feedback
from the community. I'll try to be brief (this is not the proposal).
The project is about creating a new documentation tool for Haskell projects,
like Sphinx[1] for Python or Scribble[2] for Scheme. We have Haddock,
Am Freitag 09 April 2010 02:51:23 schrieb Gregory Crosswhite:
> On Apr 8, 2010, at 5:30 PM, Casey McCann wrote:
> > On Thu, Apr 8, 2010 at 7:58 PM, wren ng thornton
> > wrote:
> >
> > Exactly. NaN /= NaN
>
> [...]
>
> > Indeed. NaN means that equality is not reflexive for floats in
> > general, on
On 04/08/10 19:56, Bas van Dijk wrote:
Control.Concurrent.Thread.fork is a similar and simpler example of why
nonInterruptibleMask is needed:
http://hackage.haskell.org/packages/archive/threads/0.1/doc/html/src/Control-Concurrent-Thread.html#fork
If an asynchronous exception is thrown during th
Tim Docker wrote:
*Main> fmap (fromSql.head.head) $ quickQuery c "select getdate()" [] ::
IO Data.Time.Clock.UTCTime
2010-04-09 09:59:20.67 UTC
*Main> fmap (fromSql.head.head) $ quickQuery c "select getdate()" [] ::
IO Data.Time.LocalTime
2010-04-09 09:59:26.313
*Main> fmap (fromSql.head.head) $
On Apr 8, 2010, at 5:30 PM, Casey McCann wrote:
> On Thu, Apr 8, 2010 at 7:58 PM, wren ng thornton wrote:
>
> Exactly. NaN /= NaN
[...]
> Indeed. NaN means that equality is not reflexive for floats in
> general, only a subset of them.
First of all, it isn't clear to me that NaN /= NaN, since i
On Thu, Apr 8, 2010 at 7:58 PM, wren ng thornton wrote:
>> They don't? I am pretty sure that a floating point number is always equal
>> to itself, with possibly a strange corner case for things like +/- 0 and
>> NaN.
>
> Exactly. NaN /= NaN.
>
> Other than that, I believe that "let x = ... in x =
On Thu, Apr 8, 2010 at 8:41 PM, Simon Michael wrote:
> With Christian's blessing, I have taken over maintenance of darcsum and
> would like to announce the 1.2 release:
Nice! I'm a power user of darcsum and I'm definitely going to try out
this release.
Thanks for maintaining this tool,
Bas
John Goerzen wrote:
> Tim Docker wrote:
> > Yes. I can use fromSql to convert the result back to an appropriate
> > numerical type. But internally the numeric data has still been converted
> > to an intermediate string representation. I'm wondering if this is
> > intentional, and whether it matters
On Thu, Apr 8, 2010 at 11:45 PM, Bas van Dijk wrote:
> On Thu, Apr 8, 2010 at 9:15 PM, Isaac Dupree
> wrote:
>> I still would like to see examples of where it's needed, because I slightly
>> suspect that wrapping possibly-blocking operations in an exception handler
>> that does something appropri
Gregory Crosswhite wrote:
On Apr 8, 2010, at 12:25 PM, Casey McCann wrote:
Seriously, floating point so-called "numbers" don't even have
reflexive equality!
They don't? I am pretty sure that a floating point number is always equal to
itself, with possibly a strange corner case for things li
On Wed, Apr 7, 2010 at 9:02 AM, Maciej Piechotka wrote:
> I guess 'works also with B in version X.Y.Z' is also. Most of the above
> changes should not be IMHO in cabal (sorry for answering PS here).
> Especially 'not maintained anymore' and 'does not build on recent
> GHC' ;)
>
>
>
> As we are wi
Ivan Lazar Miljenovic wrote:
Thomas Schilling writes:
http://i.imgur.com/kFqP3.png Didn't know about CSS's "rgba" to
describe transparency. Very useful.
It's a vely nice!! (in a Borat voice)
+1. Both for the design, and for the content.
--
Live well,
~wren
_
On Thu, Apr 8, 2010 at 9:15 PM, Isaac Dupree
wrote:
> I still would like to see examples of where it's needed, because I slightly
> suspect that wrapping possibly-blocking operations in an exception handler
> that does something appropriate, along with ordinary 'mask', might be
> sufficient... But
On Thu, Apr 8, 2010 at 4:08 PM, Yves Parès wrote:
>
> Hello Cafe,
>
> I have a question about program design.
> Let's say I have a simple sequential game (a TicTacToe for instance, but
> with more than 2 players).
> I have a Player datatype which is like:
>
> data Player m = Player {
> plName :
Okay,
Guess I will have to learn how to use git.
I used darcs so far...
Concerning the bug in bytestring, I sent a mail to dons. I just still have
no answer.
Gregory Crosswhite-2 wrote:
>
> That sounds like a reasonable modification; if you want, free to fork it
> at http://github.com/gcross
On Apr 8, 2010, at 12:25 PM, Casey McCann wrote:
> Seriously, floating point so-called "numbers" don't even have
> reflexive equality!
They don't? I am pretty sure that a floating point number is always equal to
itself, with possibly a strange corner case for things like +/- 0 and NaN.
Cheers,
That sounds like a reasonable modification; if you want, free to fork it at
http://github.com/gcross/binary-protocol and push me your proposed changes.
Cheers,
Greg
On Apr 8, 2010, at 9:12 AM, Yves Parès wrote:
>
> By the way, Gregory, concerning the package binary-protocol, I was wondering
Am Donnerstag 08 April 2010 09:17:04 schrieb Yves Parès:
> Problem tracked!
>
> It comes from the last version of bytestring package.
Alas, it's maybe not so simple.
> I tried with bytestring-0.9.1.5, and it works perfectly.
I just tried with bytestring-0.9.1.6 and it worked perfectly for sendin
I have submitted my proposal to the gsoc site taking care to include
all the feedback that was given either publicly or privately both from
people on haskell-cafe, on #haskell or from my country.
This is the last call for feedback before the submission period is
ended. One last chance to improve t
Hello Cafe,
I have a question about program design.
Let's say I have a simple sequential game (a TicTacToe for instance, but
with more than 2 players).
I have a Player datatype which is like:
data Player m = Player {
plName :: String, -- unique for each player
plTurn :: GameGrid -> m Mo
On Thu, Apr 8, 2010 at 3:25 PM, Casey McCann wrote:
> On Thu, Apr 8, 2010 at 2:09 PM, Edward Kmett wrote:
> > Template Haskell can help dull the pain, but the result seems hardly
> idiomatic.
>
> Well, since this is dealing with types and type classes, much of the
> required boilerplate could al
alexey.skladnoy:
> Hello
>
> I found that there is no monadic map for vector. It's possible to define to
> define such map using conversion to list, but I suppose it's not efficient. I
> didn't make any measurements.
>
> > mapM' :: Monad m => (a -> m b) -> V.Vector a -> m (V.Vector b)
> > mapM'
On Thu, Apr 8, 2010 at 2:09 PM, Edward Kmett wrote:
> Template Haskell can help dull the pain, but the result seems hardly
> idiomatic.
Well, since this is dealing with types and type classes, much of the
required boilerplate could also be straightforwardly derived in full
generality using type-
On 04/07/10 17:50, Simon Marlow wrote:
On 07/04/10 21:23, Bas van Dijk wrote:
On Wed, Apr 7, 2010 at 5:12 PM, Simon Marlow wrote:
Comments?
I really like this design.
One question, are you planning to write the MVar utility functions
using 'mask' or using 'nonInterruptibleMask'? As in:
wit
With Christian's blessing, I have taken over maintenance of darcsum and
would like to announce the 1.2 release:
darcs get http://joyful.com/repos/darcsum -t 1.2
darcsum is an occasionally fragile but tremendously useful emacs ui for
darcs. There is also vc-darcs.el, but I am quite productive with
Bas van Dijk gmail.com> writes:
>
> It looks like your timedIterateIO is too lazy.
>
> Try evaluating the 'y' before calling timedIterateIO' again as in:
>
> let y = f x
> ... y `seq` timedIterateIO' t0 y
>
Thank you,
that appears to do the trick.
I'm still a bit puzzled about why the prob
Tim Docker wrote:
> Jason:
>
> Thanks for the reply.
>
>> I suspect the solution is to correctly tell Haskell what type you
>> expect and then hopefully HDBC will do the conversion. For example,
>> using fromSql:
>> http://software.complete.org/static/hdbc/doc/Database-HDBC.html#v%
>> 3AfromSql
Hi Carter,
You might be interested in the 'monoids' package on hackage, which I
constructed for my own research.
http://hackage.haskell.org/package/monoids-0.1.36
This package largely covers the first half of your proposal, and provides
machinery for automatic differentiation of monoids over bim
Hello
I found that there is no monadic map for vector. It's possible to define to
define such map using conversion to list, but I suppose it's not efficient. I
didn't make any measurements.
> mapM' :: Monad m => (a -> m b) -> V.Vector a -> m (V.Vector b)
> mapM' f = return . V.fromList <=< mapM
On 04/08/10 04:23, Simon Marlow wrote:
On 07/04/2010 18:54, Isaac Dupree wrote:
On 04/07/10 11:12, Simon Marlow wrote:
It's possible to mis-use the API, e.g.
getUnmask = mask return
...incidentally,
unmask a = mask (\restore -> return restore) >>= (\restore -> restore a)
That doesn't work,
Maybe I should ask: If I have many state variables encapsulated in one IO
(StateVar DemoState) how do I go about referencing and updating _one_ without
having to enumerate all of them?
What is the syntax?
Mark
On 09/04/2010, at 12:13 AM, Mark Spezzano wrote:
> I sort of understand what people
By the way, Gregory, concerning the package binary-protocol, I was wondering
if it was possible to turn the BinaryProtocol monad from
type BinaryProtocol = StateT (Handle, Handle, ByteString) IO
to:
type BinaryProtocol = StateT (Handle, Handle, ByteString)
And then the functions, like runProtocol
On 4/6/10 15:31, Heinrich Apfelmus wrote:
In fact, it doesn't actually work for monads, I think you have to wrap
it in a newtype. :D The same effect can be achieved with `ap` , though:
Fortunately, by now most (standard) monads are also applicatives. :-)
Besides generalizing to an arbitrary nu
Dan Piponi writes:
> I have a situation where I have a bunch of lists and I'll frequently
> be making new lists from the old ones by applying map and filter.
(While keeping the old ones around, I presume?)
One option (or source of inspiration) might be lazy bytestrings, which
are stored as list
I sort of understand what people are getting at.
My basic question is now, given that I have a bunch of parameters that
represent state should I bundle up ALL of these parameters in one data type
(DemoState, say) and have ONE IORef variable that references the lot, or have
an IORef for each pie
greg:
> Jason Dagit writes:
>
> > If I understand correctly, the issue at hand is that the uninstaller
> > step is removing previous libraries and ghc?
>
> Not GHC; the HP installer removes old copies of the platform
> libraries. That's likely to break your old GHC setup though. What should
> it
2010/4/8 Eugene Kirpichov :
> I think Dan is talking about sharing the spine of the lists...
>
> How about representing the lists using something along the lines of:
>
> data List a = Nil | Leaf a | Cat (List a) (List a)
>
> data Transformed a = Changed a | Unchanged a
> extract :: Transformed a ->
2010/4/8 Eugene Kirpichov :
> I think Dan is talking about sharing the spine of the lists...
>
> How about representing the lists using something along the lines of:
>
> data List a = Nil | Leaf a | Cat (List a) (List a)
>
> data Transformed a = Changed a | Unchanged a
> extract :: Transformed a ->
I think Dan is talking about sharing the spine of the lists...
How about representing the lists using something along the lines of:
data List a = Nil | Leaf a | Cat (List a) (List a)
data Transformed a = Changed a | Unchanged a
extract :: Transformed a -> a
extract (Unchanged a) = a
extract (Cha
Id doesn´t have to create a copy of the original object ( I infer this from
referential transparency) so the new list must store the same original
reference. Any pure structure would conserve references after id. filter as
far as I know. Am I wrong?
2010/4/8 Dan Piponi
> I have a situation wh
Jason Dagit writes:
> If I understand correctly, the issue at hand is that the uninstaller
> step is removing previous libraries and ghc?
Not GHC; the HP installer removes old copies of the platform
libraries. That's likely to break your old GHC setup though. What should
it do instead?
G
--
Gr
> Is there a way to get multiple random numbers without having to
> replicateM?
>
> While comparing the random-fu interface with Control.Monad.Random (both
> using StdGen), I noticed that while performance is comparable, using
> getRandomRs to get a list of random numbers is a lot faster than
> rep
On Wed, 2010-04-07 at 16:09 -0400, Thomas Tuegel wrote:
> On Wed, Apr 7, 2010 at 3:33 PM, Duncan Coutts
> wrote:
> > The importance of this is that it lets us develop improved testsuite
> > interfaces in future. At the moment there are two test interfaces we
> > want to support. One is the simple
Hi Jason,
> If you don't run out of space, what is the registration deadline?
There's no official deadline to register with us, though we'll
probably need the names a few days ahead of time to get wifi keys for
everyone. We did get a hotel discount for people coming in from out
of town (see the
On Thu, Apr 8, 2010 at 14:00, Bernie Pope wrote:
> On 8 April 2010 19:00, Sean Leather wrote:
> > I created a few tools to help me manage multiple GHC distributions in a
> Bash
> > shell environment. Perhaps it's useful to others.
> >
> > http://github.com/spl/multi-ghc
> >
> > Feedback welcom
On Thu, Apr 8, 2010 at 13:49, Bas van Dijk wrote:
> On Thu, Apr 8, 2010 at 11:00 AM, Sean Leather wrote:
> > I created a few tools to help me manage multiple GHC distributions in a
> Bash
> > shell environment. Perhaps it's useful to others.
> >
> > http://github.com/spl/multi-ghc
> >
> > Feed
On 8 April 2010 19:00, Sean Leather wrote:
> I created a few tools to help me manage multiple GHC distributions in a Bash
> shell environment. Perhaps it's useful to others.
>
> http://github.com/spl/multi-ghc
>
> Feedback welcome. I'd also like to know if something similar exists.
Hi Sean,
I
On Thu, Apr 8, 2010 at 11:00 AM, Sean Leather wrote:
> I created a few tools to help me manage multiple GHC distributions in a Bash
> shell environment. Perhaps it's useful to others.
>
> http://github.com/spl/multi-ghc
>
> Feedback welcome. I'd also like to know if something similar exists.
Do
It looks like your timedIterateIO is too lazy.
When you pass it a function like (+1) what will happen is that a large
chunk of the form ...+1+1+1+1+1 is build up on your heap. When you
finally need its value the large chunk will be evaluated causing it to
push the '1' arguments on the stack. When
Hi,
I just put an application into hackage
http://hackage.haskell.org/package/traypoweroff. I made this application to
allow a tray icon in xmonad to poweroff and reboot my computer.
But I dislike two things I made.
The first one is the use of */sbin/poweroff* and */sbin/reboot* with
syste
I created a few tools to help me manage multiple GHC distributions in a Bash
shell environment. Perhaps it's useful to others.
http://github.com/spl/multi-ghc
Feedback welcome. I'd also like to know if something similar exists.
Regards,
Sean
___
Hask
Hi,
I am having difficulty debugging a troublesome stack overflow, which I
think might be related to calling unsafePerformIO from within the IO
monad.
So I have the following code:
import System.Random
import System.IO.Unsafe
import Data.Time.Clock
timedIterateIO :: Int -> (a -> a) -> a -> IO a
Dan Piponi wrote:
> I have a situation where I have a bunch of lists and I'll frequently
> be making new lists from the old ones by applying map and filter. The
> map will be applying a function that's effectively the identity on
> most elements of the list, and filter will be using a function that
Hi Carter
The proposal is interesting - but maybe there is not a great community
benefit to a 'covers everything' library considering Henning
Thielemann and others 'numeric prelude' already exists:
http://hackage.haskell.org/package/numeric-prelude
As a not especially mathematically inclined Has
On 07/04/2010 18:54, Isaac Dupree wrote:
On 04/07/10 11:12, Simon Marlow wrote:
It's possible to mis-use the API, e.g.
getUnmask = mask return
...incidentally,
unmask a = mask (\restore -> return restore) >>= (\restore -> restore a)
That doesn't work, as in it can't be used to unmask except
Problem tracked!
It comes from the last version of bytestring package.
I tried with bytestring-0.9.1.5, and it works perfectly.
Do you know where I should submit this bug?
-
Yves Parès
Live long and prosper
--
View this message in context:
http://old.nabble.com/Simple-binary-protocol-thr
Jason:
Thanks for the reply.
>
> I suspect the solution is to correctly tell Haskell what type you
> expect and then hopefully HDBC will do the conversion. For example,
> using fromSql:
> http://software.complete.org/static/hdbc/doc/Database-HDBC.html#v%
> 3AfromSql
Yes. I can use fromSql to c
Ivan Miljenovic writes:
> Which packages are these? I don't recall seeing any with this kind of
> "maintainer" address...
http://www.google.no/search?q=site%3Ahackage.haskell.org+maintainer+libraries%40haskell.org
-k
--
If I haven't seen further, it is by standing in the footprints of giants
On Apr 8, 2010, at 02:47 , Ivan Miljenovic wrote:
On 8 April 2010 16:29, Ketil Malde wrote:
Support, in the sense that somebody is actually responsible for the
package? (Unlike Hackage, where some packages have a
closed-for-nonsubscribers mailing list as 'maintainer'.)
Which packages are the
71 matches
Mail list logo
