, fork, polish...
Have fun,
[1]: https://github.com/np/mime-bytestring
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
headers, particularly Subject: lines (substituting
q-encoding for qp).
I would prefer quoted-printable as well, at least for the text alternative.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
On Fri, 12 Nov 2010 08:38:24 +, Simon Peyton-Jones simo...@microsoft.com
wrote:
Good point. I've done this. (Ian, could you merge)
Thank you very much for this! I was afraid to see so much code broken as well
as Michael.
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
everything.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of preventing generalization of mutable data.
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to favor
whitelists (the wiki requires admin intervention for an account, same
on HackageDB).
I think that Verified accounts sounds more appropriate than Real
Haskellers, then.
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe
On Fri, 8 Oct 2010 01:13:20 +0300, Lauri Alanko l...@iki.fi wrote:
On Thu, Oct 07, 2010 at 02:45:58PM -0700, Nicolas Pouillard wrote:
On Thu, 07 Oct 2010 18:03:48 +0100, Peter Wortmann sc...@leeds.ac.uk
wrote:
Might be off-topic here, but I have wondered for a while why Haskell
doesn't
d; e}
|
+-- do {a; x - c; b x d; e}
Imagine that b can be equal to b1 b2 and so where placing the
x - c is non obvious and it should be.
On the other hand case (- m) of {...} being translated into
m = \x - case x of {...} is non-ambigous.
Best regards,
--
Nicolas Pouillard
http
. You've
written the Scott encoding of list. The Church encoding should look
familiar:
list :: b - (a - b - b) - [a] - b
I would argue for the previous one (Scott), since we already have this one
(this is foldr with another order for arguments).
--
Nicolas Pouillard
http
an OpenID provider for myself, set my email address as insert someone
else's address here and essentially spam them.
One can verify the email address found via the OpenID.
However this would not really be spam since the email contents won't
be chosen by the spammer.
--
Nicolas Pouillard
http
though.
- If it is not enough, then having such a service for the community
would be doable and independent of the authentication. This service
could holds permissions for the different services around.
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
!
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
be better to check if extra is empty to produce
an empty list of chunks?
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of it.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 03 Aug 2010 16:36:33 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
- If there is no class instance for function types, then those problems
go away, of course. But it is doubtful whether that would be a viable
solution. Quite a few programs
On Wed, 04 Aug 2010 15:41:54 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
Actually I think we can keep the old generic seq, but cutting its full
polymorphism:
seq :: Typeable a = a - b - b
I guess I don't know enough about Typeable
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe function you are on
your own.
Clearer?
Almost. What I am missing is whether or not you would then consider your
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe
On Wed, 04 Aug 2010 18:04:13 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
function is made.
Kind regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
but not
for functions. So in this view only forcing functions would be considered
out of the language.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
in favor of renaming seq to unsafeSeq, and introduce a
type class to reintroduce seq in a disciplined way.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
can simply forbidden the forcing of function (as we do with
Eq). The few cases where it does matter will rescue to unsafeSeqFunction.
Cheers,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
the logic and perhaps the conceptual data structures. Then
better maps will be tried. Then a giant shootout will ensue, now that
Haskell finishes! I'll post here when it's ready.
Is the OCaml version available somewhere ?
--
Nicolas Pouillard
http://nicolaspouillard.fr
On Fri, 7 May 2010 08:42:31 -0700, Jason Dagit da...@codersbase.com wrote:
On Fri, May 7, 2010 at 2:29 AM, Nicolas Pouillard
nicolas.pouill...@gmail.com wrote:
On Thu, 06 May 2010 01:08:08 +0200, Günther Schmidt gue.schm...@web.de
wrote:
Hello,
I'm switching from darcs
and then use the/a mercurial fast-import.
http://vmiklos.hu/project/darcs-fast-export/
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
guess this doesn't help the
space-leak argument for the warning, however.
What about defining forkIO_ as forkIO return (), this way there is no
ugly _ - ... nor forgotten results?
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing
f = firstOthers f . map
Same thing goes to the other one.
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
this. It is restricted to the expression level, and
not the declaration level. Moreover you cannot pattern match over the
generated code.
It seems to me that metaocaml is more used as user annotated partial
evaluation?
That is a way to look at it.
--
Nicolas Pouillard
http://nicolaspouillard.fr
allows to generate names in a rather safe way
compared to camlp4.
Third reification can be done on declarations done in other files. So
that we can easily inspect the types and definitions of previous things,
which a rather hard (near to impossible) in camlp4.
Best regards,
--
Nicolas Pouillard
it might be preferable to just use
the new hGetContents. Or not?
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
Best regards,
[1]: http://www.haskell.org/pipermail/haskell/2009-March/021133.html
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) unfolding the
type definitions.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that you'll run out of file descriptors in no time. Trust me, I've
tried.)
Is the experiment easily re-doable? I would like to try using safe-lazy-io
instead.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe
for trying solution 2. and otherwise solution 4.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
would be more in line when using a purely
functional language?
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to the
response tuple.
Is there any plan to change this to a more forward compatible solution?
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a
enumToList :: Enumerator - IO [S.ByteString]
enumToList e = do ch - newChan
_ - forkIO $ e (writer ch) ()
getChanContents ch
where writer ch () chunk = do writeChan ch chunk
return (Right ())
Best regards,
--
Nicolas
concatAndSumCabooses = concatTrain (+) 0
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-defined data structure.
Is there something similar for parsing config files?
If you write one I most certainly will use it! ;)
Seriously, cmdargs is *brilliant*. It's also magic (to me).
Not only to you in fact it is black magic since it uses unsafePerformIO :(
--
Nicolas Pouillard
http
b
The functor on the Loco/Caboose makes sense too and swapping the arguments
is less natural to read.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
this on Hackage?
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Excerpts from Simon Marlow's message of Wed Nov 18 09:55:28 +0100 2009:
On 17/11/2009 12:25, Nicolas Pouillard wrote:
Excerpts from Simon Marlow's message of Tue Nov 17 12:00:21 +0100 2009:
I've just uploaded deepseq-1.0.0.0 to Hackage
Great!
I'm wondering what is the need/purpose
is to tread x.f or a variation thereof the same as (f x)
It is more like (ModuleToGuess.f x) than (f x).
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
MonadFailure e m where failure :: e - m a
Why is it called MonadFailure (specifically, what's the Monad bit doing
there)?
Because of 'Monad m' being a superclass of 'MonadFailure e m'.
Here is the class:
class Monad m = MonadFailure e m where
failure :: e - m a
--
Nicolas Pouillard
http
Excerpts from Kalman Noel's message of Tue Nov 17 12:55:54 +0100 2009:
Nicolas Pouillard schrieb:
class MonadFailure e m where failure :: e - m a
Why is it called MonadFailure (specifically, what's the Monad bit
doing
there)?
Because of 'Monad m' being a superclass
Excerpts from Simon Marlow's message of Tue Nov 17 12:00:21 +0100 2009:
I've just uploaded deepseq-1.0.0.0 to Hackage
Great!
I'm wondering what is the need/purpose for DeepSeqIntegral and DeepSeqOrd?
--
Nicolas Pouillard
http://nicolaspouillard.fr
on (xs ++ ys) where
xs and ys are already normalized so that you have only one point where you can
break this invariant.
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
calls GNU ld, it can be very costly. In my experience, on a
I confirm that I also had this experience on Arch Linux, GNU ld was allocating
Gigs of memory, however this is very hard to reproduce. Actually I've wrapped
/usr/bin/ld with a timeout :)
--
Nicolas Pouillard
http://nicolaspouillard.fr
Excerpts from wren ng thornton's message of Thu Nov 12 08:17:41 +0100 2009:
Nicolas Pouillard wrote:
Excerpts from jean-christophe mincke's message of Tue Nov 10 21:18:34 +0100
2009:
do acc - get
put (acc+1)
...
Since this pattern occurs often 'modify' is a combination
the Control.Monad.Trans.Cont [1] module.
[1]:
http://hackage.haskell.org/packages/archive/transformers/0.1.4.0/doc/html/Control-Monad-Trans-Cont.html
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe
.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell. However if this is for debugging purpose or setting up
a global exception catcher for a final product then this is fine.
[1]:
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control-Exception.html#8
--
Nicolas Pouillard
http://nicolaspouillard.fr
to statically deductible from the call site.
If you write a function and cannot prove that you will not call
head on the empty list then either you check before calling,
or you use a safe-head function or you add a pre-condition to
your function.
[1]: http://www.cl.cam.ac.uk/~nx200/
--
Nicolas
!
+1!
+1
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/libraries/base/Control-Applicative.html#t%3AWrappedMonad
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Oct 20, 2009 at 3:12 PM, Michael Snoyman mich...@snoyman.com wrote:
On Tue, Oct 20, 2009 at 11:04 AM, Nicolas Pouillard
nicolas.pouill...@gmail.com wrote:
On Sun, Oct 18, 2009 at 9:45 PM, Michael Snoyman mich...@snoyman.com
wrote:
While working on the next release of data-object
On Wed, Oct 21, 2009 at 12:02 AM, Michael Snoyman mich...@snoyman.com wrote:
On Tue, Oct 20, 2009 at 5:17 PM, Nicolas Pouillard
nicolas.pouill...@gmail.com wrote:
On Tue, Oct 20, 2009 at 3:12 PM, Michael Snoyman mich...@snoyman.com
wrote:
On Tue, Oct 20, 2009 at 11:04 AM, Nicolas
thin.
As you know OCaml always lives in an implicit big IO monad and so its
'let' syntax is a monadic do.
However there is plenty of other monads that could use the do notation,
and of course you know them well (and there is Camlp4 extensions in
OCaml for that).
Best regards,
--
Nicolas
over several lines and keeps the names closer to the binding.
You can still name intermediate *computations* using local bindings, right?
Then you just have to use the named computations in idioms brackets.
--
Nicolas Pouillard
http://nicolaspouillard.fr
), then
|
Can you elaborate on that? -+
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Category Accessor.T -- Defined at Yi/Prelude.hs:182:9-38
instance Category Accessor.T
-- Defined in data-accessor-0.2.1:Data.Accessor.Private
cabal: Error: some packages failed to install:
yi-0.6.1 failed during the building phase. The exception was:
exit: ExitFailure 1
--
Nicolas
to splitAt but I didn't made a deep investigation.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Excerpts from John MacFarlane's message of Mon Aug 03 03:05:00 +0200 2009:
I'm pleased to announce the release of yst, now available on HackageDB.
Great! I've used it for a web site of mine today with success.
--
Nicolas Pouillard
http://nicolaspouillard.fr
/ticket/3377#comment:3) which are
a lot more useful:
I vote for both extensions.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
reading I was
wondering if GADTs could help having an even nicer query language.
--
Nicolas Pouillard
http://nicolaspouillard.fr
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mapNonEmpty f x | x == mempty = mempty
| otherwise = f x
Best regards,
--
Nicolas Pouillard
http://nicolaspouillard.fr
Excerpts from Taral's message of Tue May 19 00:05:39 +0200 2009:
On Mon, May 18, 2009 at 10:30 AM, Nicolas Pouillard
nicolas.pouill...@gmail.com wrote:
The type I would need for bind is this one:
(=) :: NFData sa = LI sa - (sa - LI b) - LI b
Will this do?
(=) :: (NFData sa, NFData b
-scripts/package/rmonad
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
could add this NFData constraint, but that's not like
having a Monad instance directly.
Best regards,
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
?
On Tue, May 12, 2009 at 7:23 AM, Nicolas Pouillard
nicolas.pouill...@gmail.com wrote:
Excerpts from Vasili I. Galchin's message of Tue May 12 00:27:26 +0200
2009:
Hello,
I have forgotten whether I sent this posting out. Sorry if I did (I
didn't see on Haskell cafe archive
':
it is a member of package base, which is hidden
You want to add 'base' to the 'Build-Depends:' field of the cabal file.
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
... I don't see an additional parameter like
verbose mode that will tell which swish component is being built. ???
I don't get the relation with the subject of your post, can you elaborate?
Best regards,
--
Nicolas Pouillard
___
Haskell-Cafe mailing
Yi is the only one I would use--coding must always live inside
a screen session :) I really dislike wrapping a GUI around vi(m). I
don't want toolbars, tabs, scrollbars nor menus. I don't even want a
titlebar. Absolute full screen terminal running screen is perfect. :)
+1
--
Nicolas
it should, since tuples are decoded lazily.
Why not switch to [(Word16 :*: UArr (Word32 :*: Word8))] then?
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that makes the enables the detection
of new files. Removing files is already detected and moving should be done
with darcs mv which makes it pretty close to what one can expect.
Best regards,
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe
it would be better to treat only
the possible cases, no?
[1]:
http://www.haskell.org/ghc/docs/latest/html/libraries/base/System-IO.html#v%3AhGetLine
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Excerpts from Wei Hu's message of Mon Mar 23 17:37:15 +0100 2009:
Nicolas Pouillard nicolas.pouillard at gmail.com writes:
Hi folks,
We have good news (nevertheless we hope) for all the lazy guys standing
there.
Since their birth, lazy IOs have been a great way to modularly
://hackage.haskell.org/cgi-bin/hackage-scripts/package/strict-io
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
then restrict lifting to LazyIO to SIO actions. That would
not make LazyIO safe, but reduces surprises.
By SIO you actually mean straight-io right? I was confused because I also
have an SIO monad in the strict-io package.
--
Nicolas Pouillard
___
Haskell
.
In particular in the case 'IO', using explicit exception is maybe too heavy.
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Excerpts from Henning Thielemann's message of Sat Mar 21 22:27:08 +0100 2009:
On Fri, 20 Mar 2009, Nicolas Pouillard wrote:
Hi folks,
We have good news (nevertheless we hope) for all the lazy guys standing
there.
Since their birth, lazy IOs have been a great way to modularly
handles in particular closing them. Actually the
implementation of lazy inputs focus particularly on that---through the
'Finalized' values.
http://hackage.haskell.org/packages/archive/safe-lazy-io/0.1/doc/html/src/System-IO-Lazy-Input-Internals.html
--
Nicolas Pouillard
/Streams.html
[3]: http://www.haskell.org/pipermail/haskell/2009-March/021064.html
[4]: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/strict-io
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
) time copy of the vector (if I correctly got the code).
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
Michael
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Nicolas Pouillard
and ocamlbuild share a fair number of design
choices, maybe having a look at it could be fruitful.
Best regards,
--
Nicolas Pouillard
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ago and it's planned for the 10
December.
--
Nicolas Pouillard aka Ertai
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Nicolas Pouillard aka Ertai
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
there is a bug in there:
GHCI keywordMatch [(a, 1), (aa, 2)] aa
Nothing
The third equation of generateTrie' is missing a guard, namely k1 /= k2.
generateTrie' [(k1:ks1,v1),(k2:ks2,v2)] | k1 /= k2
= Node2 k1 (generateTrie [(ks1,v1)]) k2 (generateTrie [(ks2,v2)])
Best regards,
--
Nicolas Pouillard
function!
Here is the hackage URL:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/garsia-wachs
And the darcs 2 URL:
http://darcs.feydakins.org/garsia-wachs
--
Nicolas Pouillard aka Ertai
signature.asc
Description: PGP signature
I've just released an 1.2 version.
Excerpts from Ross Paterson's message of Tue Sep 23 05:03:29 -0700 2008:
On Mon, Sep 22, 2008 at 11:15:36PM -0700, Nicolas Pouillard wrote:
Here is an Haskell implementation of an algorithm that builds a binary
tree with minimum weighted path length from
(expr 1 + 2)))
print (ppExpr (deepIdentity (expr 0 + (0 + 0) + (0 + 0
--
Nicolas Pouillard aka Ertai
signature.asc
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
module `Graphics.Vty':
Use -v to see a list of the files searched for.
cabal: Error: some packages failed to install:
yi-0.4.3 failed during the building phase. The exception was:
exit: ExitFailure 1
Can you try the vty flag:
$ sudo cabal install yi -fvty
--
Nicolas Pouillard aka
`_', [EMAIL
PROTECTED]',
`!v'...
--
Nicolas Pouillard
signature.asc
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to read the file backward. If so
length annotations could be put at the end.
Reading backward seems to only fail with streamed data, which won't support
the seeking required by a lazy reading anyway.
Regards,
--
Nicolas Pouillard aka Ertai
signature.asc
Description: PGP signature
) and thus prefer when names don't collide
(except for modules like Data.Map or ByteString where I use the as
notation).
The key point for me is to be able to trace as fast as possible what precisely
use a module by looking (only) at the top of the file.
Best regards,
--
Nicolas Pouillard
99 matches
Mail list logo
