Call for Copy: The Monad.Reader - Issue 16
--
Whether you're an established academic or have only just started
learning Haskell, if you have something to say, please consider
writing an article for The Monad.Reader! The submission deadline
for Issue 16 will
I am very pleased to announce that Issue 15 of The Monad.Reader is now
available for your reading pleasure [1].
Issue 15 consists of the following four articles:
* The hp2any project by Gergely Patai
* Adventures in Three Monads by Edward Z. Yang
* The Operational Monad Tutorial by
On Mon, Jan 04, 2010 at 11:49:33PM +0100, Steffen Schuldenzucker wrote:
data Foo a = Foo a
instance Functor Foo where
fmap f (Foo x) = Foo . f . f $ x
Then:
fmap id (Foo x) == Foo . id . id $ x == Foo x
fmap (f . g) (Foo x) == Foo . f . g . f . g $ x
fmap f . fmap g $
On Tue, Dec 08, 2009 at 12:45:59AM +0800, L.Guo wrote:
Hi there:
My friend asked me a question, and i suppose he has found a bug of `groupBy'.
Here is the code piece:
List.groupBy (\a b - Foreign.unsafePerformIO (Text.Printf.printf \t%d =
%d ?: %s\n a b (show (a=b)) return (a=b)))
On Sat, Dec 05, 2009 at 02:13:10PM -0800, Gregory Crosswhite wrote:
The problem comes from the fact that = takes a *function* as its
second argument, and so if the first argument is an error then we
can't evaluate the second argument in order to see if it has an
error as well.
Hmm, that's
On Thu, Dec 03, 2009 at 01:50:06PM -0800, Gregory Crosswhite wrote:
Or, even more concisely:
==
sumWithError_3 = liftM2 (+)
==
Unfortunately though, neither of these definitions have the
It's not too late to write something for Issue 15 of the Monad.Reader!
Whether you're an established academic or have only just started
learning Haskell, if you have something to say, please consider
writing an article for The Monad.Reader! The submission deadline
for Issue 15 is
Hi all,
This email is literate Haskell. I'm struggling to come up with the
right way to add a fixpoint constructor to an expression language
described by a type-indexed GADT (details below). Any suggestions,
comments, or pointers welcome.
{-# LANGUAGE KindSignatures, GADTs #-}
Consider the
On Wed, Oct 21, 2009 at 07:49:14PM -0500, Tim Wawrzynczak wrote:
Yes, an if statement must have both 'then' and 'else' branches. As an
example, what if you had
let a = if b == 2 then True else False
and you were missing an else branch? What would 'a' get assigned to?
The if statement
On Wed, Oct 21, 2009 at 10:34:47AM -0700, michael rice wrote:
There's a thread on the plt-scheme list about creating a function of NO
arguments named NEXT that just returns the number of times it's been called,
a piece of cake in Scheme, but how would one do this in Haskell? Would the
best
On Sun, Oct 11, 2009 at 06:29:58PM -0400, Brandon S. Allbery KF8NH wrote:
On Oct 11, 2009, at 18:00 , Ben Franksen wrote:
Ben Franksen wrote:
Ben Franksen wrote:
Next thing I'll try is to transform such a grammar into an actual
parser...
Which I also managed to get working.
First, before
Do you know any category theory? What helped me finally grok free
theorems is that in the simplest cases, the free theorem for a
polymorphic function is just a naturality condition. For example, the
free theorem for
flatten :: Tree a - [a]
is precisely the statement that flatten is a natural
Call for Copy: The Monad.Reader - Issue 14
--
Whether you're an established academic or have only just started
learning Haskell, if you have something to say, please consider
writing an article for The Monad.Reader! The submission deadline for
Issue 14 will
Er, correction, obviously that should be Issue 15, not 14. The submission
deadline is correct, though! =)
On Sun, Oct 11, 2009 at 02:34:54PM -0400, Brent Yorgey wrote:
Call for Copy: The Monad.Reader - Issue 14
--
Whether you're an established
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as editor of the
Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as editor.
I'd like to take this opportunity to thank Brent
On Tue, Sep 29, 2009 at 12:54:21AM -0700, Anatoly Yakovenko wrote:
number = do { num - natural
; return $ num
}
main = do
txt - hGetContents stdin
print $ parse number stdin txt
why doesn't that work?
Could you be a little more specific? What are you
Hi all,
I'm pleased to announce version 0.2.1 of the diagrams library,
available now on Hackage [1]. This is a minor release which fixes a
few bugs and adds a few new combinators, most notably a grid layout
combinator contributed by Ganesh Sittampalam. For a full list of the
features new to
On Sun, Sep 20, 2009 at 03:11:04PM -0400, Joe Fredette wrote:
Ahh, I found the issue. I generated this on the 18th, the software makes
files of the form yearmonthdate.ext, so when Brent uploaded the hwn
for me, the link it generates is to the date it was generated on, not the
date it was
On Sat, Sep 05, 2009 at 11:18:24AM +, Gracjan Polak wrote:
Hi all,
In DEFUN 2009: Multicore Programming in Haskell Now!
(http://donsbot.wordpress.com/2009/09/05/defun-2009-multicore-programming-in-haskell-now/),
slide 30 I see:
Don't “accidentally parallelize”:
– f `par` f + e
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090905
Issue 129 - September 05, 2009
---
Welcome to issue 129 of HWN, a newsletter
Executive summary:
* I'm looking for someone to take over as HWN editor
* It is highly automated and doesn't take as much time as you might
think (about 3-4 hours/week on average)
* You DON'T need to be a Haskell guru
* It is far from a thankless job and is a fun way to provide an
On Sat, Sep 05, 2009 at 05:26:08PM -0400, Brent Yorgey wrote:
Executive summary:
* I'm looking for someone to take over as HWN editor
* It is highly automated and doesn't take as much time as you might
think (about 3-4 hours/week on average)
* You DON'T need to be a Haskell guru
On Fri, Aug 14, 2009 at 05:04:00PM +0100, Eric Kow wrote:
Dear Haskellers,
Just a quick reminder that we will be having a Hack Day in Edinburgh
on Sunday 30 August (ICFP venue). That's in two weeks!
For the interested, we will also be meeting up the day before 09:30
Saturday 29 August
..
* Edward Kmett: [84]Clearer Reflections.
* Petr Rockai: [85]soc final report.
* Gergely Patai: [86]hp2any overview online.
* Brent Yorgey: [87]New 2D text layout library.
* Manuel Chakravarty: [88]World's first formal machine-checked proof
of a general-purpose operating system
2009.2.0.2.
* Gergely Patai: [106]More profiling goodies.
* Don Stewart (dons): [107]Heuristics for Blessing Software Packages.
* David Amos: [108]How to count the number of positions of Rubik's
cube.
* Edward Kmett: [109]Slides from Hac Phi: All About Monoids.
* Brent Yorgey
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090718
Issue 126 - July 18, 2009
---
Welcome to issue 126 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090712
Issue 125 - July 12, 2009
---
Welcome to issue 125 of HWN, a newsletter covering
On Sun, Jul 12, 2009 at 07:01:11PM +0200, Raynor Vliegendhart wrote:
On 7/12/09, Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Raynor Vliegendhart wrote:
On 7/9/09, Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Of course, some part of algorithm has to be recursive, but this can
On Thu, Jul 09, 2009 at 10:57:19AM -0400, xu zhang wrote:
I have trouble in returning a list of Figures. I want return a type of m
(Maybe [Figure IO]), but the type of dv_findFigure is :: a - Point - s
(Maybe (Figure s)). How can change the code below to get a s (Maybe [Figure
s])?
Thank you
test with Cabal.
* Ketil Malde: [50]Dephd updates.
* Bryan O'Sullivan: [51]What's in a text API?.
* Brent Yorgey: [52]2009 ICFP programming contest reflections.
* Galois, Inc: [53]Galois, Inc. Wins Two Small Business Research
Awards from Federal Agencies.
* Greg Bacon
On Wed, Jul 01, 2009 at 12:00:50AM -0400, a...@spamcop.net wrote:
G'day all.
On Tue, Jun 30, 2009 at 08:02:48PM -0400, Daniel Peebles wrote:
But we don't want to imply it's commutative either. Having something
bidirectional like or + feels more commutative than associative
to me.
Quoting
On Tue, Jun 30, 2009 at 09:45:45AM -0700, Bryan O'Sullivan wrote:
I've thought for a while that it would be very nice indeed if the Monoid
class had a more concise operator for infix appending than a `mappend` b.
I wonder if other people are of a similar opinion, and if so, whether this
is
On Mon, Jun 29, 2009 at 11:40:28AM -0700, Justin Bailey wrote:
Anyways, for those who care, the heart of my VM implementation was a
monadic fold over the program, with a mutable array representing the
machine's memory, all inside ''runSTUArray.'' I used a simple data
type to represent the
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090629
Issue 123 - June 29, 2009
---
Welcome to issue 123 of HWN, a newsletter covering
On Sun, Jun 21, 2009 at 09:16:12PM +0100, Andrew Coppin wrote:
Niklas Broberg wrote:
That's what GADTs are for:
data Flag = HasZoo | NoZoo
data Foobar a where
Foo :: Foobar a - Foobar a
Bar :: Foobar a - Foobar a
Zoo :: Foobar a - Foobar HasZoo
Ouch #1: This appears to
On Sun, Jun 21, 2009 at 05:53:04PM +0100, Andrew Coppin wrote:
OK, so I'm guessing there might be one or two (!) people around here who
know something about the Lambda calculus.
I've written a simple interpretter that takes any valid Lambda expression
and performs as many beta reductions as
On Sun, Jun 21, 2009 at 07:48:30PM +0100, Andrew Coppin wrote:
Andrew Coppin wrote:
Well anyway, the obvious thing to do is after each reduction, strip off
all the variable indicies and rerun the labeller to assign new indicies.
But does this solution work properly in general?
No.
On Mon, Jun 15, 2009 at 12:38:02PM -0700, Ashley Yakeley wrote:
Magnus Therning wrote:
Philippa Cowderoy wrote:
On Mon, 2009-06-15 at 13:52 -0400, Gwern Branwen wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
On Mon, Jun 15, 2009 at 1:18 PM, Ashley Yakeley wrote:
For requesting
be
useful for optimizing simple compilers for referentially transparent
domain specific languages.
Hac phi accommodation: register by June 15 for reduced rate! Brent
Yorgey [23]reminded anyone interested in attending [24]Hac phi that
Monday 15 June is the deadline for getting a special
On Fri, Jun 12, 2009 at 03:00:12PM +0100, Paul Keir wrote:
Thanks Ryan, I'm slowly becoming aware of the effects of Monomorphism. I'll
look
again at Neil Mitchell's blog post.
I guess it's the same thing when I try:
let a = 1
a + 1.0
I'm taking the mono as a clue that the type
On Fri, Jun 12, 2009 at 08:22:25PM +0200, Daniel Fischer wrote:
Am Freitag 12 Juni 2009 18:46:41 schrieb Gwern Branwen:
There are only 3 bureaucrats/admins; one is a dummy account, one is
Ashley, and one is John Peterson (who hasn't edited for a year).
One solution would be to have Ashley
On Wed, Jun 10, 2009 at 04:43:57PM +0100, Eric Kow wrote:
Dear Haskellers,
ICFP 2009 takes place from Monday 31 August to Wednesday 2 September,
with the Haskell Symposium following it on 3 September.
Would anybody be interested having a Haskell Hackathon during this? My
thinking is that
Hi all,
This is a quick reminder for people interested in attending Hac phi
who have not yet reserved a hotel room: if you'd like to reserve a
room at Club Quarters at the reduced rate ($114/night single,
$129/night double), we ask that you send a note to Daniel Wagner
(dan...@wagner-home.com) by
in Philadelphia, July 24-26. Brent Yorgey
[23]announced Hac phi, a Haskell hackathon/get-together to be held July
24-26 at the University of Pennsylvania in Philadelphia. The hackathon
will officially kick off at 2:30 Friday afternoon, and go until 5pm on
Sunday (with breaks for sleep
On Sun, May 31, 2009 at 06:20:23PM -0700, Iavor Diatchki wrote:
and so on. It is a bit verbose, but you only have to do it once for
your protocol, and then you get the nice overloaded interface.
This also seems like the kind of thing perfectly suited to Template
Haskell. Especially if the
Greetings,
I am very pleased to officially announce Hac phi, a Haskell
hackathon/get-together to be held July 24-26 at the University of
Pennsylvania in Philadelphia. The hackathon will officially kick off
at 2:30 Friday afternoon, and go until 5pm on Sunday (with breaks for
sleep, of course).
On Wed, May 27, 2009 at 10:39:20AM -0700, Thomas DuBuisson wrote:
Manu,
Did you skip over the dozens of links at haskell.org answering exactly
these questions? There are links to some great tutorials [1] and IRC
information where you can get real-time help [2]. Also there are some
good
.
-Brent
On Sun, May 24, 2009 at 01:35:40PM -0400, Andrew Wagner wrote:
Is there a list of projects that will be worked on during this, or how will
that work?
On Thu, May 21, 2009 at 5:39 PM, Brent Yorgey byor...@seas.upenn.eduwrote:
Hi all!
We are in the early stages of planning
On Sun, May 24, 2009 at 10:39:50AM +0200, Petr Pudlak wrote:
On Sun, May 24, 2009 at 12:18:40PM +0400, Eugene Kirpichov wrote:
Haskell has terms depending on types (polymorphic terms) and types
depending on types (type families?), but no dependent types.
But how about undecidability? I'd
and notable
in this release is support for lazy, chunked text, so you can process
text files far larger than memory using a small footprint.
Haskell Hackathon in Philadelphia. Brent Yorgey [10]announced Hac phi,
a Haskell hackathon to be held in Philadelphia in July. Check out the
[11
Hi all!
We are in the early stages of planning a Haskell hackathon/get
together, Hac φ, to be held this summer at the University of
Pennsylvania, in Philadelphia. Right now we're looking at two
possible dates:
June 19-21or July 24-26
If you might be interested in attending, please add
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090516
Issue 118 - May 16, 2009
---
Welcome to issue 118 of HWN, a newsletter covering
On Thu, May 14, 2009 at 03:58:18PM -0300, José Romildo Malaquias wrote:
Then the resulting of pretty printing the given tree would be something
like the following:
a
|
+-+
|||
bcd
||
+---++---+
| || |
On Mon, May 11, 2009 at 10:59:01PM -0700, michael rice wrote:
In the code below, is the type returned by the return functions inferred from
the result type in the function type signature, i.e., just change the result
type to Maybe Int and the code will return a Maybe monad, (Just 4), instead
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090512
Issue 117 - May 12, 2009
---
Welcome to issue 117 of HWN, a newsletter covering
On Tue, May 05, 2009 at 05:36:12PM +0200, Tillmann Rendel wrote:
PS. I'm not a native speaker, but shouldn't it be movies and not films?
Both are correct. =)
-Brent
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, May 04, 2009 at 03:08:25PM +0200, Martijn van Steenbergen wrote:
Andrew Wagner wrote:
[quote]
Here's [a]language to to interpret (where postfix * means tupling):
Variables: x Integer literals: i Terms: t = Lambda x*. t | Apply t t*
| Var(x) | Num(i)
Can someone explain
On Mon, May 04, 2009 at 02:52:17PM +0200, Gü?nther Schmidt wrote:
Hi,
I've gotten used to darcs now, and use it for my project. There is one
quirk though, I also added some rather large binary files, an sqlite
database and an MS Access database to the repository.
Now whenever I do a push
On Sat, May 02, 2009 at 05:31:03PM +0100, Paul Keir wrote:
On the wiki page for Applicative Functors
(http://www.haskell.org/haskellwiki/Applicative_functor) a familiar
characteristic of monads is quoted; that they allow you to run actions
depending on the outcomes of earlier actions. I
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090502
Issue 116 - May 02, 2009
---
Welcome to issue 116 of HWN, a newsletter covering
On Sun, Apr 26, 2009 at 03:23:17PM +0200, Thomas van Noort wrote:
This is a recurring problem[1] and I'm still looking for a really
satisfying solution. The only working and non-verbose solution I found is
the one Miguel suggests. Although I'm not too fond of splitting up the
monadic
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090425
Issue 115 - April 25, 2009
---
Welcome to issue 115 of HWN, a newsletter covering
On Fri, Apr 24, 2009 at 06:52:09PM +, Keith Battocchi wrote:
I'm trying to write some code to do folds on nested datatypes as in
http://web.comlab.ox.ac.uk/people/Jeremy.Gibbons/publications/efolds.pdf but
running into trouble getting things to typecheck.
Given the types
data Nest a
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090417
Issue 114 - April 17, 2009
---
Welcome to issue 114 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090405
Issue 112 - April 05, 2009
---
Welcome to issue 112 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090328
Issue 111 - March 28, 2009
---
Welcome to issue 111 of HWN, a newsletter covering
On Sat, Mar 28, 2009 at 05:07:37PM +, RAJESH DALSANIYA wrote:
* *
*Both sections relate to the case study: Index for a document of
text.*
Hi Rajesh, this looks a lot like a homework assignment. Please see
http://haskell.org/haskellwiki/Homework_help
Many people are happy to
On Wed, Mar 25, 2009 at 05:54:17PM +1030, Mark Spezzano wrote:
What, strictly speaking, is the definition of ”tail recursive” as opposed to
just “recursive”?
A recursive function is tail recursive if the final result of the
recursive call is the final result of the function itself. If the
On Sat, Mar 21, 2009 at 12:52:49PM +0100, Achim Schneider wrote:
Jon Fairbairn jon.fairba...@cl.cam.ac.uk wrote:
That's where that particular design falls down. = is an
ugly symbol in the first place, and while the pun with a
lambda in the middle provides some intellectual
satisfaction,
consists of the following four
articles: Rapid Prototyping in TEX by Stephen Hicks; The
Typeclassopedia by Brent Yorgey; a Real World Haskell book review by
Chris Eidhof and Eelco Lempsink; and Calculating Monads with Category
Theory by Derek Elkins.
dzen-utils 0.1. Felipe Lessa [34
On Thu, Mar 19, 2009 at 08:58:08AM +, Danny Chan wrote:
By the way, for the complete newbie that I am, is there a standard way to
report bugs for a package from Hackage?
Most packages on Hackage have a 'Maintainer' field providing an email
address to which you can send bug reports.
On Thu, Mar 19, 2009 at 11:55:16AM +0100, Manlio Perillo wrote:
Note that I have not uploaded it on Hackage, and I do not plan to upload it
in the near future, at least until I will repute the package mature enough.
I would encourage you to upload it to Hackage regardless of its
supposed
On Tue, Mar 17, 2009 at 11:39:05AM +0100, Martijn van Steenbergen wrote:
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeOperators #-}
module Eq where
data (a :=: a') where
Refl :: a :=: a
class Eq1 f where
eq1 :: f a - f a' - Maybe (a :=: a')
class Eq2 f where
eq2 :: f a b - f a' b' -
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090314
Issue 109 - March 14, 2009
---
Welcome to issue 109 of HWN, a newsletter covering
On Fri, Mar 13, 2009 at 02:32:23PM +, Ross Paterson wrote:
On Fri, Mar 13, 2009 at 03:18:15PM +0100, Martijn van Steenbergen wrote:
Are there any functors f for which no point/pure/return :: a - f a exists?
No. Choose an arbitrary element shape :: f () and define
point x =
On Fri, Mar 13, 2009 at 05:35:31PM +0300, Eugene Kirpichov wrote:
'An arbitrary element' means 'undefined will suffice'
point x = fmap (const x) undefined
This is false.
Prelude fmap (const 1) [()]
[1]
Prelude fmap (const 1) undefined
*** Exception: Prelude.undefined
-Brent
I was not able to make the haddock documentation appear in Hackage,
although I have no problem generating documentation using cabal
haddock locally. It would be nice if there is a way to see some
diagnose of warning or error messages why haddock failed on Hackage.
It is there now.
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090307
Issue 108 - March 07, 2009
---
Welcome to issue 108 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090228
Issue 107 - February 28, 2009
---
Welcome to issue 107 of HWN, a newsletter
of the library from Dominic Steinitz.
The Typeclassopedia, and request for feedback. Brent Yorgey
[16]announced a [17]first draft of an article entitled 'The
Typeclassopedia', a starting point for the student of Haskell wishing
to gain a firm grasp of its standard type classes. Comments
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090217
Issue 105 - February 17, 2009
---
Welcome to issue 105 of HWN, a newsletter covering
Hi all,
If you've noticed the lack of a HWN this week, that's because I've
been doggedly finishing my article entitled 'The Typeclassopedia',
which I have just submitted for publication in the Monad.Reader.
Here's the abstract:
The standard Haskell libraries feature a number of type classes
On Thu, Feb 12, 2009 at 04:10:21PM +0100, Wolfgang Jeltsch wrote:
Am Donnerstag, 12. Februar 2009 15:34 schrieb Thomas DuBuisson:
Daniel Kraft asked:
That sounds interesting... What do you mean by no canonical library?
Are there already ones but just no standard one? But in this case,
. Brent Yorgey [32]announced version 0.2 of the
[33]diagrams package, an embedded domain-specific language for creating
simple graphics in a compositional style. New features include support
for arbitrary paths, text, multiple output formats, and support for the
[34]colour library
On Mon, Feb 02, 2009 at 10:55:52AM +0600, Artyom Shalkhakov wrote:
Hello,
2009/2/2 Pieter Laeremans pie...@laeremans.org:
Has anyone some exampe usages of : Network.UrlDisp ?
I'll write it up in a few days. Right now, you can read the blog posts
of Sterling Clover, topics covered there
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090131
Issue 103 - January 31, 2009
---
Welcome to issue 103 of HWN, a newsletter covering
I am very pleased to announce the 0.2 release of the diagrams package,
an embedded domain-specific language for creating simple graphics in a
compositional style. This release includes a number of significant
new features, including:
* support for arbitrary straight and curved paths
* more
On Sat, Jan 31, 2009 at 06:23:29PM -0500, Braden Shepherdson wrote:
Brent Yorgey wrote:
I am very pleased to announce the 0.2 release of the diagrams package,
Would this make a handy plugin for gitit? I'm currently putting diagrams
together in xfig and saving them to my gitit tree while
On Sun, Feb 01, 2009 at 03:43:35AM +0100, Henning Thielemann wrote:
Brent Yorgey schrieb:
I am very pleased to announce the 0.2 release of the diagrams package,
an embedded domain-specific language for creating simple graphics in a
compositional style. This release includes a number
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090124
Issue 102 - January 24, 2009
---
Welcome to issue 102 of HWN, a newsletter covering
On Thu, Jan 22, 2009 at 04:57:56PM -0800, Jonathan Cast wrote:
On Tue, 2009-01-20 at 19:14 +, Andrew Coppin wrote:
Jonathan Cast wrote:
On Mon, 2009-01-19 at 21:04 +, Andrew Coppin wrote:
I mean, heck, *I* use Haskell at work - and I'm not even supposed to be
coding things!
the catch is, read
his message.
split-0.1.1 (doc bugfix; new functions wordsBy and linesBy). Brent
Yorgey [46]announced version 0.1.1 of the [47]split library. This
version fixes some Haddock bugs, and adds two new convenience functions
suggested by Neil Mitchell, wordsBy and linesBy
On Mon, Jan 19, 2009 at 01:03:55PM -0800, Daryoush Mehrtash wrote:
lift m = ReaderT $ \_ - m
return a = ReaderT $ \_ - return a
If you look carefully you will see that these are not the same.
-Brent
___
Haskell-Cafe mailing list
* fixes a couple Haddock bugs that were preventing the documentation
from building on Hackage, and
OK, the documentation is really *actually* fixed now. Thanks to Ross
Paterson for upgrading haddock on the Hackage build machine!
Check out the Haddocky, documentationy goodness:
Version 0.1.1 of the split library is now on Hackage, which provides a
wide range of strategies and a unified combinator framework for
splitting lists with respect to some sort of delimiter.
This version:
* fixes a couple Haddock bugs that were preventing the documentation
from building on
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090110
Issue 100 - January 10, 2009
---
Welcome to issue 100 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090103
Issue 99 - January 03, 2009
---
Welcome to issue 99 of HWN, a newsletter covering
On Sat, Jan 03, 2009 at 12:01:06AM +, Jamie Brandon wrote:
The haskell community has a well deserved reputation for being one of
the friendliest online communities. Perhaps this would be a good point
to figure out what we're doing right? I'm convinced that part of it is
that offtopic
. Brent Yorgey [25]announced the release of
[26]Data.List.Split, which provides a wide range of strategies and a
unified combinator framework for splitting lists with respect to some
sort of delimiter.
Hoogle with more libraries. Neil Mitchell [27]announced that [28]Hoogle
will now
On Mon, Dec 22, 2008 at 06:19:07PM +0100, Peter Padawitz wrote:
I'd like to define a monad Set for types in the class Eq. But how can the
arguments of Set be constrained when Set is defined as an instance of
Monad? instance Eq a = Monad Set where ... obviously cannot work.
Is there a
201 - 300 of 472 matches
Mail list logo
