Bonjour Café, bonjour Bryan
I have a program that works fine on linux, but doesn't on windows.
On windows XP with the latest Haskell platform, I get:
socket: 1860: hFileSize: invalid argument (Bad file descriptor)
I think the problem is with hGetContents from Data.Text.IO, but my
google-fu
Re-bonjour Café, Bryan,
I have a program that works fine on linux, but doesn't on windows.
Is there something I'm doing wrong ?
Checking the source code for Data.Text.IO.hGetContents, I see that the
only time hFileSize is used is in chooseGoodBuffering when the
buffering is in block mode, so I
M. George Hansen technopolit...@gmail.com wrote:
I've been playing around with functional reactive programming using
Animas/Yampa and ran into a strange situation. I'm using a parallel
switch to route input to a collection of signal functions and using
the output as feedback (to simulate
I would like to announce the first release of my program lushtags.
Available on hackage: cabal install lushtags
At github: https://github.com/bitc/lushtags
Screenshot:
https://github.com/bitc/lushtags/raw/master/doc/screenshot-tagbar-2011-09-19.png
What is lushtags? From the README:
lushtags
2011/9/20 Bit Connor b...@mutantlemon.com:
I would like to announce the first release of my program lushtags.
Available on hackage: cabal install lushtags
At github: https://github.com/bitc/lushtags
Screenshot:
https://github.com/bitc/lushtags/raw/master/doc/screenshot-tagbar-2011-09-19.png
Hi Bit Connor,
I like very much that you've also listed related work.
Would you mind comparing the tag generation engine with the solutions
you've pointed out?
Eg does it depend on ghc? Does it reuse one of the existing solutions
for generating tags - eg is it a wrapper only?
Eg hothasktags
Sometimes when one of our developers (using Arch-linux) tries to cabal
install packages he gets
a no instance for error.
Code that compiles fine on my computer, and other computers I try it
on. Even some packages on hackage
(trying to install aeson-native for instance gives
I believe this is because of aeson depending on *any* version of
deepseq. This was very recently fixed in the development version:
https://github.com/mailrank/aeson/pull/25
2011/9/20 Rune Harder Bak r...@bak.dk:
Sometimes when one of our developers (using Arch-linux) tries to cabal
install
I see the aeson version with the stricter dependency on deepseq 1.2
is now also released on hackage:
http://hackage.haskell.org/package/aeson-0.3.2.12
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, 2011-09-19 at 22:09 -0700, Evan Laforge wrote:
Then I tried switching to a fixed point format, and discovered my
mistake. Enum is supposed to enumerate every value between the two
points, and the result is memory exhaustion.
I'm not sure where you read that Enum is supposed to
On Tue, Sep 20, 2011 at 10:59 AM, Chris Smith cdsm...@gmail.com wrote:
I certainly hope not. Instead, perhaps the issue should be brought up
with the fixed-point number library you're using, and they could fix
their Enum instance to be more helpful.
I'm the author of the library in question.
On Tue, Sep 20, 2011 at 10:59 AM, Chris Smith cdsm...@gmail.com wrote:
The better way to look at this is that the notion of `succ` and `pred`
is dependent on the type, much like `mappend` has no particular meaning
until a Monoid instance is given for the type. It's fairly well
established,
Chris Smith cdsm...@gmail.com writes:
It would be a shame if we lost an occasionally useful and easy to read
You forgot confusing? Expecting Enum to enumerate all inhabitants of
a type seems very reasonable to me, and seems to hold for all
non-floating point types. A numeric range [a..a+n]
On Tuesday 20 September 2011, 17:39:49, Ketil Malde wrote:
Chris Smith cdsm...@gmail.com writes:
It would be a shame if we lost an occasionally useful and easy to read
You forgot confusing? Expecting Enum to enumerate all inhabitants of
a type seems very reasonable to me, and seems to hold
On Tue, 2011-09-20 at 17:39 +0200, Ketil Malde wrote:
You forgot confusing?
I didn't forget it; whether it's confusing or not depends on the
perspective you're coming from. The kids in my beginning programming
class are using Enum (via the list syntactic sugar) on Float and don't
get
Daniel Fischer writes:
A numeric range [a..a+n] might be expected
to have a+n+1 elements, but that doesn't hold either for Float and
Double. I think Enum for floating point values is broken
Yes, it is. Like Eq and Ord.
.. only more so. And the brokenness has infected Rational: try
Hi,
i have upgraded to doctest version 0.4.1.
Now when i try to run the example from the webpage, i get:
doctest: Interpreter exited with an error: ExitFailure 127
What's wrong here and how can i fix it?
Kind regards
Chris
This is the content of Fib.hs:
module Fib where
-- | Compute
Hi,
I want to ask a question about hackage which contains additional libraries to
Haskell. Is there a mechanism that will help developer to choose a library
among the others?
I mean, there are several packages that may do the same thing in hackage and to
choose one among the others, developer
On Tue, Sep 20, 2011 at 12:47 PM, Paterson, Ross r.pater...@city.ac.uk wrote:
Daniel Fischer writes:
A numeric range [a..a+n] might be expected
to have a+n+1 elements, but that doesn't hold either for Float and
Double. I think Enum for floating point values is broken
Yes, it is. Like Eq and
On Tue, 2011-09-20 at 15:28 -0400, Casey McCann wrote:
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have other values disappear from the set as
a result.
Definitely Ord is
Quoth Chris Smith cdsm...@gmail.com,
...
As for Enum, if someone were to want a type class to represent an
enumeration of all the values of a type, then such a thing is reasonable
to want. Maybe you can even reasonably wish it were called Enum. But
it would be the *wrong* thing to use as a
On Tue, Sep 20, 2011 at 3:48 PM, Chris Smith cdsm...@gmail.com wrote:
But it would be the *wrong* thing to use as a desugaring for list range
notation. List ranges are very unlikely to be useful or even meaningful
for most such enumerations (what is [ Red, Green .. LightPurple]?); and
On Tue, Sep 20, 2011 at 1:22 PM, Jake McArthur jake.mcart...@gmail.comwrote:
On Tue, Sep 20, 2011 at 3:48 PM, Chris Smith cdsm...@gmail.com wrote:
But it would be the *wrong* thing to use as a desugaring for list range
notation. List ranges are very unlikely to be useful or even meaningful
This makes me wonder if maybe the reason this discussion is happening
at all is that we don't have a well-defined meaning for what Enum
*is*. At this point, it seems like the only answer is that it's
I agree, that's why I suggested a separate 'range' function. I think
the all values in this
Hello,
I get so frustrated trying to convince managers and colleagues of the
efficacy of FPLs. Below speaks volumes about the type safety of C and C++.
It is a bandaid approach.
Vasili
Hi
There have been plans to add rankings to Hackage and a GSOC looked
into adding them.
Roel van Dijk built reverse dependencies for Hackage which illustrated
the most popular libraries, unfortunately the link seems broken:
http://bifunctor.homelinux.net/~roel/hackage/packages/hackage.html
Of
Hi,
Am Dienstag, den 20.09.2011, 22:07 +0100 schrieb Stephen Tetley:
There have been plans to add rankings to Hackage and a GSOC looked
into adding them.
Roel van Dijk built reverse dependencies for Hackage which illustrated
the most popular libraries, unfortunately the link seems broken:
On Tue, Sep 20, 2011 at 3:48 PM, Chris Smith cdsm...@gmail.com wrote:
On Tue, 2011-09-20 at 15:28 -0400, Casey McCann wrote:
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have
On Tue, 2011-09-20 at 16:22 -0400, Jake McArthur wrote:
This makes me wonder if maybe the reason this discussion is happening
at all is that we don't have a well-defined meaning for what Enum
*is*.
Certainly, we don't have a type-independent definition for Enum. I'm
not sure whether it's
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have other values disappear from the set as
a result. Getting an unexpected element in a list doesn't really seem
as bad as silently
Hello everyone,
I've decided to translate the famous Learn You a Haskell for Great Good in
French a few weeks ago, and I'm pleased to share it with you all today!
Well, especially with the French-speaking community, but I guess everyone
should be aware of its existence, in case you ever encounter
complete enumeration. I'm taking it for granted that the current
behavior on Float is useful; I honestly don't see how you could argue
with that. People use it all the time; I used it just this morning. Of
course it's useful.
It was useful but not as useful as a 'range' function. I
On Tue, 2011-09-20 at 17:28 -0400, Casey McCann wrote:
Since removing the instances entirely is
probably not a popular idea, the least broken solution would be to
define NaN as equal to itself and less than everything else, thus
accepting the reality of Ord as the meaningless arbitrary total
On Wed, 2011-09-21 at 00:04 +0200, Ketil Malde wrote:
If Haskell defined list syntax in terms of something that's not called
Enum, that would be fine. Renaming is never all that big a deal. But
the list sugar is a big deal, and I don't think there's any point at all
in leaving the list
On Tue, Sep 20, 2011 at 5:56 PM, Evan Laforge qdun...@gmail.com wrote:
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have other values disappear from the set as
a result. Getting
On Tuesday 20 September 2011, 23:56:53, Evan Laforge wrote:
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have other values disappear from the set as
a result. Getting an
Nice initiative, Valentin !
However, even if I'm french I'm gonna need a little help with the monads
being like crêpes...
2011/9/21 Valentin ROBERT valentin.robert...@gmail.com
Hello everyone,
I've decided to translate the famous Learn You a Haskell for Great Good in
French a few weeks ago,
On Tue, 2011-09-20 at 16:05 -0600, Chris Smith wrote:
On Tue, 2011-09-20 at 17:28 -0400, Casey McCann wrote:
Since removing the instances entirely is
probably not a popular idea, the least broken solution would be to
define NaN as equal to itself and less than everything else, thus
On Wednesday 21 September 2011, 00:20:09, Casey McCann wrote:
This plays havoc with the search tree used internally by Set and Map,
the result being that if you have any NaN values in the data
structure, you may not be able to find other values anymore. Because
NaN values never compare equal
On Wednesday 21 September 2011, 00:38:12, Maciej Marcin Piechotka wrote:
+1 for:
class Eq a = Iq a where
(.) :: a - a - Bool
(.) :: a - a - Bool
Regards
-1 for the class name, too easy to miscount the Es.
And perhaps it would be better to add the IEEE compliant(?)
On Tue, Sep 20, 2011 at 6:58 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Wednesday 21 September 2011, 00:20:09, Casey McCann wrote:
Because
NaN values never compare equal to themselves, I'm not sure if it's
even possible to remove them from the structure,
filter (not .
I'm not totally sure, but I sense that you may need a one-instant delay
in your looping code here:
rec
let senses = map (\state - (inputEvents, state)) states
states - par route activities - senses
Try adding a one-instant delay by passing the output of
On Tue, Sep 20, 2011 at 4:23 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Wednesday 21 September 2011, 00:38:12, Maciej Marcin Piechotka wrote:
+1 for:
class Eq a = Iq a where
(.) :: a - a - Bool
(.) :: a - a - Bool
Regards
-1 for the class name, too easy to
On Wednesday 21 September 2011, 01:23:48, Casey McCann wrote:
On Tue, Sep 20, 2011 at 6:58 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Wednesday 21 September 2011, 00:20:09, Casey McCann wrote:
Because
NaN values never compare equal to themselves, I'm not sure if it's
On Wed, 2011-09-21 at 01:23 +0200, Daniel Fischer wrote:
On Wednesday 21 September 2011, 00:38:12, Maciej Marcin Piechotka wrote:
+1 for:
class Eq a = Iq a where
(.) :: a - a - Bool
(.) :: a - a - Bool
Regards
-1 for the class name, too easy to miscount the Es.
On Tue, Sep 20, 2011 at 17:56, Evan Laforge qdun...@gmail.com wrote:
I actually think the brokenness of Ord for floating point values is
worse in many ways, as demonstrated by the ability to insert a value
into a Data.Set.Set and have other values disappear from the set as
Whoah, that's
On Tue, Sep 20, 2011 at 6:05 PM, Chris Smith cdsm...@gmail.com wrote:
There's nothing *wrong* with pragmatism, but in any case, we seem to
agree on this. As I said earlier, we ought to impose a (rather
arbitrary) total order on Float and Double, and then offer comparison
with IEEE semantics
On Tue, Sep 20, 2011 at 7:38 PM, Maciej Marcin Piechotka
uzytkown...@gmail.com wrote:
+1 for:
class Eq a = Iq a where
(.) :: a - a - Bool
(.) :: a - a - Bool
We already have this but it is hidden inside a library. It's called
PartialOrd [1] and it's on the logfloat package.
On Tue, Sep 20, 2011 at 8:20 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
Yes, where NaNs matter, you always have to check (well, unless you *know*
that your calculations don't produce any NaNs).
Btw, -0.0 can be problematic too.
How so? As far as I can tell Ord and Eq treat it
I'm starting to play around with GHC's support for view patterns, and I'm
running into what appears to be an annoying limitation of the
implementation.
GHC 7.0.3 (32-bit), MacOS 10.6.8.
First module; defines an abstract type provides a (trivial) view for it.
module Term(Term, TermView(..),
Hello!
I'm pleased to announce the first version of the skein package [1]!
Skein is a family of fast secure cryptographic hash functions [2].
The skein package provides high-level bindings (using crypto-api [3])
to the optimized Skein C library. Currently we support Skein as a
hash function and
On 21/09/2011, at 2:59 AM, Chris Smith wrote:
On Mon, 2011-09-19 at 22:09 -0700, Evan Laforge wrote:
Then I tried switching to a fixed point format, and discovered my
mistake. Enum is supposed to enumerate every value between the two
points, and the result is memory exhaustion.
% ghci
Recently I've been playing around with Parsec for a simple parsing
project. While I was able to quickly construct my grammar (simplified
version attached), getting it working has been a bit tricky. In
particular, I am now stuck trying to figure out why Parsec is
mis-reporting line numbers. Parsec
On Tue, 20 Sep 2011, Alexander Solla wrote:
On Tue, Sep 20, 2011 at 1:22 PM, Jake McArthur jake.mcart...@gmail.com wrote:
On Tue, Sep 20, 2011 at 3:48 PM, Chris Smith cdsm...@gmail.com wrote:
But it would be the *wrong* thing to use as a desugaring for list range
notation.
Hello,
To those who are in Tokyo for ICFP:
The typhoon is likely to come after 16:00 today. Many students and
workers will go home earlier this afternoon. It's Japanse style.
If typhoon comes, umbrella does not work. Please stay in your
building. You should understand all traffic transportation
On 21/09/2011, at 2:18 PM, Casey McCann wrote:
I still don't see why it makes sense to add separate IEEE comparisons
instead of just adding a standard partial order class, though.
In any mathematical partial order, we expect
x `le` x
to be a law. But in IEEE arithmetic, if x is a
On Wed, Sep 21, 2011 at 12:47 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
In any mathematical partial order, we expect
x `le` x
to be a law. But in IEEE arithmetic, if x is a NaN, x `le` x is
false. I don't see how to reconcile these.
I agree that a standard partial order class
On Wednesday 21 September 2011, 04:18:38, Casey McCann wrote:
On Tue, Sep 20, 2011 at 8:20 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
Yes, where NaNs matter, you always have to check (well, unless you
*know* that your calculations don't produce any NaNs).
Btw, -0.0 can be
Hi,
One of the recurring issues that comes up in Warp is binding to IPv4
versus IPv6 hosts. Our current code is available at [1]. It was
updated to look like that in this commit [2] in order to support both
IPv4 and IPv6 hosts by default. However, now it seems than on Debian
and FreeBSD, it
On 09/21/2011 03:53 AM, Felipe Almeida Lessa wrote:
Hello!
I'm pleased to announce the first version of the skein package [1]!
Skein is a family of fast secure cryptographic hash functions [2].
The skein package provides high-level bindings (using crypto-api [3])
to the optimized Skein C
60 matches
Mail list logo
