One solution would be to fold over a specific semigroup instead of a
recursive function:
|import Data.Semigroup
import Data.Foldable(foldMap)
import Data.Maybe(maybeToList)
data Darle a =Darle {getInit :: [a],getLast ::a }
deriving Show
instance Semigroup (Darle a)where
On Thu, Aug 29, 2013 at 9:30 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.ukwrote:
Greetings café,
Perhaps some saddening news for Markdown fans out there. As you might
remember, there was a fair amount of push for having Markdown as an
alternate syntax for Haddock.
This is a little
Is there an up todate copy of the haddock manual online anywhere?
On Saturday, August 31, 2013, Omari Norman wrote:
On Thu, Aug 29, 2013 at 9:30 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.uk javascript:_e({}, 'cvml',
'fuuze...@fuuzetsu.co.uk'); wrote:
Greetings café,
Perhaps some
Great package!
One question: Do you remove/inline type synonyms? I ask because I just ran into
this with some TH code. I'm looking for types that end with - a, but that
fails when type synonyms are involved.
Sjoerd
On Aug 30, 2013, at 2:08 AM, Richard Eisenberg e...@cis.upenn.edu wrote:
On 31/08/13 16:20, Carter Schonwald wrote:
Is there an up todate copy of the haddock manual online anywhere?
No. You can build your own documentation. In Haddock directory, go into
‘doc’ and read the README on how to build it. That is also outdated
however: for example, it doesn't provide
Hello,
I disagree.
While none of your detail points are wrong, they mainly focus on the
fact that there is no 1-to-1 mapping between the existing haddock markup
and Markdown. I don't think there needs to be. If Markdown can do
something new, that something can be added; if something doesn't make
On 31/08/13 19:14, Niklas Hambüchen wrote:
Hello,
I disagree.
That's fine, that's why the thread is here.
While none of your detail points are wrong, they mainly focus on the
fact that there is no 1-to-1 mapping between the existing haddock markup
and Markdown. I don't think there needs
Hi. I was just curious about something. In one of my math textbooks I
see expressions like this
f + g
or
(f + g)(a)
where f and g are functions. What is meant is
f(a) + g(a)
Is there a way in Haskell you can make use of syntax like that (i.e.,
expressions like f + g and f * g to create a
