On 6/7/11 1:01 PM, James Cook wrote:
On Jun 7, 2011, at 12:43 PM, MigMit wrote:
wren ng thornton wrote:
One particularly trivial example that comes to mind is:
newtype Mu f = Mu (f (Mu f))
instance Show (f (Mu f)) = Show (Mu f) where
show (Mu x) = Mu ( ++ show x ++ )
-- Or however you'd like
On 6/6/11 1:52 AM, Yitzchak Gale wrote:
You almost never want to use UndecidableInstances
when writing practical programs in Haskell.
When GHC tells you that you need them, it almost
always means that your types are poorly designed,
usually due to influence from previous experience
with OOP.
On 6/5/11 1:33 PM, Brandon Allbery wrote:
On Sun, Jun 5, 2011 at 07:45, Patrick Brownepatrick.bro...@dit.ie wrote:
Are the following two functions equivalent? (i.e. do they describe the
same computation)
let add1 a = a + 2
let add2 = \ a - a + 2
Mostly. The monomorphism restriction can
On 6/4/11 9:41 AM, Tillmann Vogt wrote:
Am 04.06.2011 15:00, schrieb Sebastian Fischer:
http://www.shirky.com/writings/ontology_overrated.html
I think I have read that article a long time ago. I just looked at it
again. Very lengthy but true.
In the middle there is a section when ontologies
On 6/2/11 8:59 AM, Aleksandar Dimitrov wrote:
Hi Ketil,
By the way, what is the advantage of using iteratees here? For my
testing, I just used:
My initial move to iteratees was more a clutch call I made when I was still
using bytestring-trie, and was having immense memory consumption
On 5/28/11 8:31 AM, Daniel Fischer wrote:
On Saturday 28 May 2011 14:19:18, Dmitri O.Kondratiev wrote:
Thanks for simple and beautiful code to get all pairs.
Yet, I need to get to the next step - from all pairs to build all
chains, to get as a result a list of lists:
[[abcde, acde, ade, ae,]
On 5/25/11 1:56 PM, Antoine Latter wrote:
On May 25, 2011 12:50 PM,qu...@sparq.org wrote:
Quoting Antoine Latteraslat...@gmail.com:
The only thing I'd add would be the additional actions ReplacedBy,
ExtendedBy and RedesignedBy.
I was actually thinking that this was the part that HackageDB
On 5/25/11 1:03 PM, Bryan O'Sullivan wrote:
On Wed, May 25, 2011 at 5:59 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Well, using the Char8 version.
Just because you *could* do that, it doesn't mean that you *should*. It's a
bad idea to use bytestrings for manipulating text,
On 5/25/11 5:20 PM, Brandon Moore wrote:
From: Jacek Generowicz Sent: May 25, 2011 2:45 PM
On 2011 May 25, at 17:42, Gwern Branwen wrote:
I feel a bit guilty about spamming the list with all my stupid problems: I would
prefer to find my own way around, but if I had to dive in and rummage around
On 5/22/11 8:40 AM, Aleksandar Dimitrov wrote:
If you have too much trouble trying to get SRILM to work, there's
also the Berkeley LM which is easier to install. I'm not familiar
with its inner workings, but it should offer pretty much the same
sorts of operations.
Do you know how BerkeleyLM
On 5/21/11 3:56 PM, Aleksandar Dimitrov wrote:
Hi Haskellers,
I'm unaware of a good method or default way of handling large datasets to
which I need non-sequential (i.e. random) access in Haskell.
My use case is linguistic analysis of a ~30GB corpus — the most basic form of
quantitative
On 5/19/11 5:51 PM, Antoine Latter wrote:
On Thu, May 19, 2011 at 3:06 PM, Simon Meieriridc...@gmail.com wrote:
The core problem that drove me towards this solution is the abundance
of different IntX and WordX types. Each of them requiring a separate
Write for big-endian, little-endian,
On 5/18/11 2:25 PM, Tom Murphy wrote:
I'd give three reasons for disagreeing:
1. Developing a complete GUI has been a low priority up until now, but
now that other, more urgent areas of development are starting to
thrive, its time has come.
2. Yes, having essentially no complete GUI support has
On 5/18/11 10:54 PM, Manuel M T Chakravarty wrote:
Nevertheless, there are good reasons to develop native applications (especially
on the Mac with its user-base spoiled by high-end UX). Luckily, the choice of
toolkit is trivial in this case. For Mac OS, we need a Haskell-Cocoa binding.
I
On 5/17/11 11:53 PM, KC wrote:
If you're importing the module as
import qualified Math.FFT as FFT
Shouldn't Math.FFT become FFT? :)
Nope.
Depending on your definition of should at least. Hierarchical modules
are not considered entities exported by modules further up on the tree.
So
On 5/12/11 3:22 PM, Andrew Coppin wrote:
There is an isNaN function somewhere.
N.B., on Hugs (September 2006), isNaN is flagrantly broken; so is
isInfinite. I have a solution available[1], but alas, it seems unlikely
to ever make its way back upstream.
Moral: double check your compiler
On 5/9/11 10:04 PM, Antoine Latter wrote:
On Mon, May 9, 2011 at 5:07 PM, Eric Rasmussenericrasmus...@gmail.com wrote:
Hi everyone,
I am relatively new to Haskell and Parsec, and I couldn't find any articles
on parsing numbers in the following format:
Positive: $115.33
Negative: ($1,323.42)
-- stm-chans 1.2.0
The stm-chans package offers a collection of channel types, similar to
Control.Concurrent.STM.TChan but with additional features.
--
On 5/7/11 4:29 PM, Eitan Goldshtrom wrote:
I know about the $ symbol, that's why it's in there in the respective
places. I see that I can use it to fix my problem, but I was trying to
figure out function composition really. I guess that's just not the
place for it. I'll check out
On 5/7/11 5:15 PM, dm-list-haskell-c...@scs.stanford.edu wrote:
In general, I try to place as few requirements in the contexts of
functions as possible.
One counterargument to this philosophy is that there are many cases
where fmap can be defined more efficiently than the liftM derived from
On 5/6/11 11:15 AM, Alex Mason wrote:
Hi All,
I really love the look of this package, but if this is going be *the* iteratee
package, I would absolutely love to see it fix some of the biggest mistakes in
the other iteratee packages, soecifically naming. A change in naming for the
terms
On 5/5/11 10:36 AM, Scott Kilpatrick wrote:
I'm looking for real code that uses the kind of GHC rewrite rule
that specializes a polymorphic function with another one, as described
herehttp://www.haskell.org/ghc/docs/latest/html/users_guide/rewrite-
rules.html#rule-spec. Can anyone point me to
On 4/26/11 9:55 AM, Ertugrul Soeylemez wrote:
wren ng thorntonw...@freegeek.org wrote:
But the greatest thing about Maybe is that you don't *have* to write
code in monadic style. Because Maybe makes explicit the null-pointer
shenanigans in other languages, you can simply unwrap the Maybe and
Hello all,
I have some loopy code I'd like to make parallel, but I'm not sure the
best way to go about it. Everywhere else in this program I'm using STM,
but that seems pretty heavy-handed for this task, and it looks like the
perfect place for `par` and friends.
So the 10,000ft view of the
On 4/23/11 8:02 AM, Sönke Hahn wrote:
Hi!
I would like to have a library that would allow to use QuickCheck in the
normal manner, but it would save test data for failing properties on the
filesystem (maybe using the shiny new acid-state?). On consecutive test
runs, the saved test data would be
On 4/22/11 11:39 AM, Simon Michael wrote:
On 4/21/11 10:16 PM, wren ng thornton wrote:
rather, what I'd like is someplace to keep my code which also provides a
good bugtracker. Unfortunately, neither darcsden nor patchtag offer
darcsden does include a simple issue tracker now.
Ah, excellent
On 4/22/11 8:16 AM, Robert Clausecker wrote:
Some weeks ago, I mirrored the hugs repo to github.
(https://github.com/fuzxxl/Hugs) This was, when I found out, that the
last commit was about 2 years ago. Also, since some of the dependencies
moved, I was unable to build hugs.
Now my question is:
On 4/22/11 3:26 PM, Henning Thielemann wrote:
On Fri, 22 Apr 2011, Christopher Done wrote:
Use of Fantom's save invoke and Maybe are more or less the same.
-- Hard way
email = if userList /= Nothing
then let user = findUser bob (fromJust userList)
in if user /=
On 4/22/11 1:14 PM, Evan Laforge wrote:
Here's a simple issue that's been with me for a while. As do many
people, I use plural variable names for lists, so if a Block as called
'block' then [Block] is 'blocks'.
The other pattern that comes up a lot is 'Maybe Block'. When I have
to name it, I
On 4/21/11 10:33 PM, Simon Michael wrote:
+1 to what you said.
On 4/21/11 4:16 PM, John Meacham wrote:
Incidentally, I wrote a github like site based around darcs a few
years ago at codehole.org. It is just used internally by me for
certain projects. but if people were interested, I could
Hello all,
I'm in need of a Unicode normalization function, Utf8 NFC for ByteString
in particular. From some quick Googling around it looks like the only
available option is to use ICU in some form. The text-icu package has a
nice binding to it, but unfortunately that means a lot of redundant
On 4/16/11 9:55 AM, Felipe Almeida Lessa wrote:
On Sat, Apr 16, 2011 at 10:29 AM, Nikhil A. Patil
patil.nik...@gmail.com wrote:
doit :: DSL Term
doit = do (+)- (+)
n0- n0
k- k
-- begin beautiful DSL code
let x = k + n0
return $ x + x
I
On 4/14/11 1:24 PM, Bryan Richter wrote:
Perhaps the following change would be sufficient?
--- tmp/GhcMake.hs~ 2011-04-14 09:46:02.177298318 -0700
+++ tmp/GhcMake.hs 2011-04-14 09:52:25.121290827 -0700
@@ -1460,7 +1460,8 @@
cyclicModuleErr :: [ModSummary] - SDoc
cyclicModuleErr
On 4/8/11 8:55 AM, Twan van Laarhoven wrote:
-- this class is useful beyond this FRP library,
-- you might already be able to find it on hackage somewhere
class Functor f = Filterable f where
filter :: (a - Bool) - f a - f a
-- filter p . fmap f == fmap f . filter (p . f)
-- filter (const True)
On 4/8/11 8:24 AM, Henning Thielemann wrote:
Magnus Therning schrieb:
AFAIK there is no way to do that, thouhg scion[1] may offer it.
Personally I develop more complex local functions at the top-level,
and once I'm happy with it I perform some re-factoring and move it in.
I would not write
On 4/3/11 11:58 PM, Thomas DuBuisson wrote:
Wren,
Glad to see someone is doing a more complete packaging of STM helpers
and derivatives!
I've done a little work on bounded TChans[1] (hackage bounded-tchan
package) and I think you should consider a few things:
Ah, somehow I missed that in my
On 4/4/11 4:42 PM, Jason Dagit wrote:
Is this something people would be interested in having as an extension in
GHC? Or is it just too fluffy for anyone to really care?
I'd much rather have _ on the RHS of equations be a way of specifying
terms that the compiler should infer. This is pretty
On 4/5/11 11:22 PM, Ivan Lazar Miljenovic wrote:
On 6 April 2011 13:13, wren ng thorntonw...@freegeek.org wrote:
On 4/4/11 4:42 PM, Jason Dagit wrote:
Is this something people would be interested in having as an extension in
GHC? Or is it just too fluffy for anyone to really care?
I'd
-- stm-chans 1.0.0
The stm-chans package offers a collection of channel types, similar to
Control.Concurrent.STM.TChan but with additional features. In particular
it offers these types:
*
On 4/1/11 3:59 PM, Dmitry Olshansky wrote:
But enumFile use IO monad instead of MonadIO class.
[...]
Is it possible to change enumFile to using MonadIO class?
Unless its changed significantly since I looked at it last (which it may
well have), it's not possible. The problem is that what we'd
On 3/30/11 4:44 AM, Simon Marlow wrote:
On 30/03/2011 03:12, wren ng thornton wrote:
FYI, testsuite results for OSX 10.5.8 32-bit build:
2695 total tests, which gave rise to
14978 test cases, of which
0 caused framework failures
12589 were skipped
2302 expected passes
74 expected failures
0
On 3/31/11 4:30 AM, wren ng thornton wrote:
On 3/30/11 4:44 AM, Simon Marlow wrote:
On 30/03/2011 03:12, wren ng thornton wrote:
FYI, testsuite results for OSX 10.5.8 32-bit build:
2695 total tests, which gave rise to
14978 test cases, of which
0 caused framework failures
12589 were skipped
On 3/28/11 10:33 PM, Jens Petersen wrote:
FYI testsuite results:
[...]
8 unexpected failures on x86:
DoParamM(normal)
T3064(normal)
T3330a(normal)
T3738(normal)
T4316(ghci)
T4801(normal)
break024(ghci)
space_leak_001(normal)
FYI, testsuite results for OSX 10.5.8
On 3/29/11 4:40 AM, o...@okmij.org wrote:
Wren Thornton wrote:
This is often conflated with the iteratee throwing an error/exception,
which is wrong because we should distinguish between bad program
states and argument passing.
I guess this is a matter of different points of view on
On 3/27/11 7:16 AM, Johan Tibell wrote:
On Sun, Mar 27, 2011 at 1:03 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
*** Build multiple Cabal packages in parallel ***
http://hackage.haskell.org/trac/summer-of-code/ticket/1594
Many developers have multi-core machines but Cabal runs the
On 3/27/11 11:38 AM, John A. De Goes wrote:
Enumeratees solve some use cases but not others. Let's say you want to incrementally
compress a 2 GB file. If you use an enumeratee to do this, your transformer
iteratee has to do IO. I'd prefer an abstraction to incrementally and purely produce the
On 3/27/11 9:58 PM, John Millikin wrote:
Resending is slightly more complex -- if the other end can say resend that
last chunk, then it should be easy enough, but resend the last 2 bytes of
that chunk you sent 5 minutes ago would be much harder. What is your use
case?
This does highlight one
On 3/26/11 4:33 PM, John A. De Goes wrote:
4. Iteratees cannot incrementally produce output, it's all or nothing, which
makes them terrible for many real world problems that require both incremental
input and incremental output.
For this one, enumeratees are the proposed solution. But for
-- unix-bytestring 0.3.4
The unix-bytestring package offers a full selection of
Unix/Posix-specific functions for reading and writing ByteStrings to Fds.
--
On 3/21/11 4:16 AM, Christian Maeder wrote:
Am 20.03.2011 20:01, schrieb wren ng thornton:
So I'm having a go of installing ghc-7.0.2 and
haskell-platform-2011.2.0.0 on OSX 10.5. Since 10.5 is no longer
supported I've had to compile from source. The good news is, so far as I
can tell
So I'm having a go of installing ghc-7.0.2 and
haskell-platform-2011.2.0.0 on OSX 10.5. Since 10.5 is no longer
supported I've had to compile from source. The good news is, so far as I
can tell, everything works right out of the box.[1]
But I've noticed when compiling the base libraries and
-- unix-bytestring 0.3.2
The unix-bytestring package offers a full selection of
Unix/Posix-specific functions for reading and writing ByteStrings to Fds.
--
So I have a rules-lawyering question about how specified the overflow
behavior is for the types Int and Word.
* In the Haskell 2010 report it seems to be specified that (sections
18.1, 23.1): All arithmetic is performed modulo 2^n, where n is the
number of bits in the type. And this seems to
Another question on particulars. When dealing with natural numbers, we
run into the problem of defining subtraction. There are a few reasonable
definitions:
(1) If the result would drop below zero then throw an overflow error;
(2) Use saturating subtraction, i.e. if the result would drop
On 3/17/11 2:50 PM, Luke Palmer wrote:
If you are implementing lazy naturals, I wonder if defining 0 - 1 to
be infinity makes mathematical sense. It's like arithmetic mod
infinity
Actually, I'm specifically implementing strict naturals :)
There are a number of libraries for lazy naturals
On 3/17/11 9:18 AM, Andy Stewart wrote:
On Sat, Feb 12, 2011 at 6:57 PM, Jan Christiansenj...@informatik.uni-kiel.de
wrote:
if you have written at least 1 lines of code in Haskell,
Goodness. It looks like my current project is over 17,275 lines
including documentation but excluding
On 3/17/11 3:30 PM, David Menendez wrote:
In What About the Natural Numbers, Colin Runciman argues for [...]
Thanks for the reference, I'll go check it out.
--
Live well,
~wren
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 3/17/11 4:22 PM, Martin Escardo wrote:
On 17/03/11 18:35, wren ng thornton wrote:
(2) Use saturating subtraction, i.e. if the result would drop below zero
then return zero;
This is what people working with quantales do.
Subtraction y-z, when it exists, is the solution in s to the equation
On 3/17/11 5:12 PM, Conor McBride wrote:
On 17 Mar 2011, at 18:35, wren ng thornton wrote:
Another question on particulars. When dealing with natural numbers, we
run into the problem of defining subtraction. There are a few
reasonable definitions:
No there aren't.
How about pragmatically
On 3/16/11 9:52 AM, Andrew Coppin wrote:
Hmm, yes. That will work, but I wonder if there's some way of doing this
that doesn't limit the scope of the container to one single span of
code...
You can write helper functions which take containers as argument by
parameterizing these helper
On 3/14/11 2:01 AM, pt...@acanac.net wrote:
Hi Wren;
I CC'ed you on email I sent Thu, 10 Mar after seeing your post on
haskell-cafe Thu Mar 10 07:24:45 CET Haskell mail server fail?. Did
you see that email?
I didn't see it; though it looks like it just showed up in my inbox. The
only other
Like Kenneth Hoste, I haven't been receiving mails from haskell-cafe@
nor libraries@ for a few days to a week now. What is the status of the
mailing lists?
(Please CC me off-list, for obvious reasons)
--
Live well,
~wren
___
Haskell-Cafe mailing
On 3/7/11 6:38 PM, Alexander Solla wrote:
'seq' is not a function, since it breaks referential transparency and
possibly extensionality in function composition. By construction, seq a b
= b, and yet seq undefined b /= b. Admittedly, the Haskell report and
the GHC implementation, diverge on
On 3/7/11 6:58 PM, Alexander Solla wrote:
The magic semantics of evaluating the first argument are done by the
compiler/runtime, and are apparently not expressible in Haskell.
Of course this is true. The only ways of forcing evaluation in Haskell
are (a) to perform pattern matches on a value,
On 3/4/11 2:32 PM, Jason Dusek wrote:
On Fri, Mar 4, 2011 at 07:01, wren ng thorntonw...@freegeek.org wrote:
where the annotation of MergeAnn is merged with the previous
annotation up the tree (via mappend), thus allowing for
annotations to be inherited and modified incrementally based
on the
On 3/4/11 4:33 PM, Alexander Solla wrote:
On Thu, Mar 3, 2011 at 10:14 PM, wren ng thorntonw...@freegeek.org wrote:
On 3/3/11 2:58 AM, Antti-Juhani Kaijanaho wrote:
On Thu, Mar 03, 2011 at 12:29:44PM +0530, Karthick Gururaj wrote:
Thanks - is this the same unit that accompanies IO in IO ()
On 3/3/11 3:33 AM, Hauschild, Klaus (EXT) wrote:
Hi Haskellers,
is there a recommended structure for Haskell projects. I like the Maven way
(http://maven.apache.org/guides/introduction/introduction-to-the-standard-directory-layout.html)
for Java projects. How to separate productive from test
On 3/3/11 7:18 PM, Jacek Generowicz wrote:
Hi Cafe,
It seems that I don't understand what groupBy does.
I expect it to group together elements as long as adjacent ones satisfy
the predicate, so I would expect ALL four of the following to give one
group of 3 and a group of 1.
Prelude :m +
On 3/3/11 8:14 PM, Brandon S Allbery KF8NH wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 3/3/11 20:09 , Jacek Generowicz wrote:
1 2 ok, same group
1 3 dito
1 2 dito
Thus you get [[1,2,3,2]]
OK, that works, but it seems like a strange choice ...
Stability is often valued in
On 3/3/11 2:58 AM, Antti-Juhani Kaijanaho wrote:
On Thu, Mar 03, 2011 at 12:29:44PM +0530, Karthick Gururaj wrote:
Thanks - is this the same unit that accompanies IO in IO () ? In
any case, my question is answered since it is not a tuple.
It can be viewed as the trivial 0-tuple.
Except that
On 3/4/11 1:32 AM, Jason Dusek wrote:
Hi List,
I am working on a Bash config generation system. I've decided
to factor out the Bash AST and pretty printer, here in a
pre-release state:
https://github.com/solidsnack/bash
Awesome!
Given that every statement has an
On 2/28/11 2:50 AM, Niklas Broberg wrote:
Ah, I suppose that's to do with the trac server itself, that's beyond me.
Moving to café: Does anyone know what's up with trac.haskell.org not sending
out verification emails?
Having just signed up, like a few hours ago, it took a long while for
the
On 2/28/11 6:01 AM, Yves Parès wrote:
takeC :: Int - Compoz a b - (exists c. Compoz a c)
dropC :: Int - Compoz a b - (exists c. Compoz c b)
What does 'exists' means? To create a rank-2 type can't you use:
takeC :: Int - Compoz a b - (forall c. Compoz a c)
??
For any A and T,
On 2/28/11 2:43 AM, Yitzchak Gale wrote:
You have written a large software system in Haskell. Wishing to
play to Haskell's strength, you have structured your system
as a series of composable layers. So you have data types
Layer1, Layer2, ...
and functions
layer2 :: Layer1 - Layer2
layer3 ::
On 2/25/11 2:24 PM, Andrew Coppin wrote:
I've heard much about this iteratee things, but I've never looked into
what the hell it actually is.
Today I had a look at TMR #16, which is an explanation which I can just
about follow. It seems that it's actually a kind of fold - not unlike
the streams
On 2/23/11 8:06 PM, wren ng thornton wrote:
On 2/23/11 4:42 PM, Sterling Clover wrote:
A quick grep of some of my own source reveals that I've used M.size
and S.size only to test for sizes equal to 1. So, for my purposes at
least, an O(1) isSingleton operation would be just as useful as an
O(1
On 2/24/11 3:05 AM, Joachim Breitner wrote:
Hi,
Am Mittwoch, den 23.02.2011, 20:06 -0500 schrieb wren ng thornton:
On 2/23/11 4:42 PM, Sterling Clover wrote:
A quick grep of some of my own source reveals that I've used M.size and S.size
only to test for sizes equal to 1. So, for my purposes
On 2/24/11 3:45 PM, Andrew Coppin wrote:
OK, so I had a function that looks like
transform :: [Word8] - [Word16]
It works nicely, but I'd like to use mutable state inside. No problem!
Use the ST monad. Something like
transform :: [Word8] - [Word16]
transform xs = runST (work xs)
where
work ::
On 2/23/11 4:42 PM, Sterling Clover wrote:
A quick grep of some of my own source reveals that I've used M.size and S.size
only to test for sizes equal to 1. So, for my purposes at least, an O(1)
isSingleton operation would be just as useful as an O(1) size.
I agree, a fast isSingleton
On 2/22/11 2:26 AM, C K Kashyap wrote:
Hi,
Is there a runtime performance difference between a haskell program running
under GHCI vs in its compiled form?
Especially for a long running program - as in, ignoring the initial setup
time.
If I understand right, in both case tree reduction is what is
On 2/18/11 8:38 PM, Johan Tibell wrote:
Hi all,
I am delighted to announce the release of preview versions of two new packages:
unordered-containers 0.1
Efficient hashing-based container types.
http://hackage.haskell.org/package/unordered-containers
How does, or will, this package differ
On 2/12/11 11:41 AM, Tim Chevalier wrote:
What's important is not just that
Haskell has static typing, but that algebraic data types are a rich
enough language to let you express your intent in data and not just in
code. That helps you help the compiler help you.
ADTs are an amazing thing to
-- 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 2/7/11 9:42 AM, Malcolm Wallace wrote:
To combine licences, just aggregate them. There is no lattice of
subsumption; no more or less restrictive ordering. It's simple: you
must obey all of them.
In the event that my comments on the previous thread were a source of
confusion, I agree with
On 2/8/11 6:00 AM, Ketil Malde wrote:
This does seem a bit excessive. As a start, I don't remember anyone
asking for control over (un)boxedness, so hopefully we could jettison
that part of it?
Uh, you mean like in IOUArrays, the UNPACK pragma, or
-funbox-strict-fields? Unboxing is an
On 2/6/11 4:53 PM, Ivan Lazar Miljenovic wrote:
On 7 February 2011 08:12, Alexey Khudyakovalexey.sklad...@gmail.com wrote:
Also there is a container-classes package which provide set of type class
for containers.
[1] http://hackage.haskell.org/package/container-classes
Don't use that
On 2/5/11 4:26 AM, Claus Reinke wrote:
Lately I've been trying to go the other direction: make a large
section of formerly strict code lazy.
There used to be a couple of tools trying to make suggestions
when a function could be made less strict (Olaf Chitil's StrictCheck and
another that
So I'm working on a project that uses STM to run a lot of things in
parallel without the headaches of locks. So far it's working
beautifully, STM rocks. But there's one snag...
Sometimes I need those threads to do some IO like printing logging info.
I'd like to make these IO chunks atomic
I managed to track down the problem at last. And, as might be expected
after staring at it for so long, it was a fairly boneheaded thing. Turns
out the error was from an entirely different thread which is using
Attoparsec and a modified version of attoparsec-iteratee. I never
suspected this
On 2/2/11 11:25 PM, Maciej Wos wrote:
I think the problem is that the iteratee you give to I.convStream
always returns Just [something] while you should return Nothing on
EOF.
That makes sense for the hanging problem (which I only noticed during
debugging). Though I still get the the same
On 2/3/11 8:05 AM, John Lato wrote:
I don't have too much to add to Maciej and Oleg's reply, except that I'd
recommend looking at the Wave codec over the Tiff reader in those versions
of iteratee. I don't think that's the only problem, though, because then
you'd be getting a Divergent iteratee
On 2/3/11 10:48 AM, Max Cantor wrote:
Does it make sense to relegate OSX x86_64 to community status
while the 32-bit version is considered a supported platform?
I'm not sure I can make sense of what you mean here. Given the preamble,
I'd guess you're asking whether we should make x86_64 the
On 2/3/11 7:19 PM, Brandon S Allbery KF8NH wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 2/3/11 19:16 , Brandon S Allbery KF8NH wrote:
POSIX FIFOs and GHC's nonblocking file descriptors implementation don't play
well together; you should launch the writer end first and let it block
Max Cantor wrote:
someone? wrote:
I think the original poster is saying that the targeted architecture for OS X
support
should be the architecture that OS X assumes by default, and these days that's
x86_64.
That sounds reasonable to me. The big caveat is that OSX = 10.5.8
10.6 should
On 2/3/11 9:28 PM, Max Cantor wrote:
Doesn't 10.5.x have the ability to generate and run 64-bit binaries?
Yes, it does. But it defaults to 32-bit as I recall. Richard O'Keefe
suggested a general practice of targeting the architecture considered
default by the operating system. That's a good
I'm working on a project that's using John Lato's old implementation of
iteratees (iteratee = 0.3.5 0.4; I'm hoping to migrate to 0.7
soon, but that's a ways off yet) and I'm running into some issues I
haven't been able to untangle. Maybe a new set of eyes can help...
The overarching
On 1/28/11 7:25 AM, Maciej Piechotka wrote:
On Thu, 2011-01-27 at 19:36 -0500, wren ng thornton wrote:
you distribute your work as GPL2 and someone does some derivative work
that they want to distribute as GPL3, then technically they must
distribute the composite work under the *joint* license
On 1/26/11 5:51 AM, Maciej Piechotka wrote:
Some projects (like Linux) remove this clause and I'm not sure how many
projects are marked on hackage as GPL2 being GPL2-only.
Technically GPLx and GPLy are incompatible for all x and y such that x
/= y. The problem is that *technically* the
On 1/17/11 10:46 PM, C K Kashyap wrote:
Hi,
I was going through http://en.wikipedia.org/wiki/Monad_(category_theory) -
under Formal Definition I notice that monad is a Functor T:C - C
My question is - when we think of Maybe as a functor T:C - C should we
think that C here refers to
On 1/12/11 5:34 PM, Tim Chevalier wrote:
On Mon, Jan 10, 2011 at 8:52 AM, Malcolm Wallacemalcolm.wall...@me.com wrote:
If I were considering contributing minor patches to a project, the use of
git would probably not deter me too much - I can cope with the simple stuff.
But if I wanted more
301 - 400 of 1018 matches
Mail list logo
