* Anthony Cowley [2010-02-21 14:15:00-0500]
> On Sun, Feb 21, 2010 at 1:58 PM, Artyom Kazak wrote:
> > So, if I type "./prog +RTS --RTS +RTS", the output will be "+RTS". But
> > I want the output to be equal to the input IN ALL CASES, without any
> > quotes, additional options, etc. I want all th
* Brandon S. Allbery KF8NH [2010-02-24 00:02:12-0500]
> On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
> >* Anthony Cowley [2010-02-21 14:15:00-0500]
> >>#! /usr/bin/env bash
> >>./prog --RTS $*
> >
> > ./prog --RTS "$@"
> >
> >O
* Artyom Kazak [2010-02-24 10:23:07+0200]
> 2010/2/24 Brandon S. Allbery KF8NH :
> > On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
> >>
> >> * Anthony Cowley [2010-02-21 14:15:00-0500]
> >>>
> >>> #! /usr/bin/env bash
> >>> ./pr
* Magnus Therning [2010-02-24 09:11:54+]
> On Wed, Feb 24, 2010 at 07:18, Roman Cheplyaka wrote:
> > * Brandon S. Allbery KF8NH [2010-02-24 00:02:12-0500]
> >> On Feb 22, 2010, at 03:36 , Roman Cheplyaka wrote:
> >> >* Anthony Cowley [2010-02-21 14:15:00-050
By coincidence, today I found a bug in the parsec 3.0.[01]. Probably due
to changes introduced the bug is absent in parsec 3.1.0.
I think it is worth to release 3.0.2 with this bug fixed.
The bug itself is demonstrated in the following code. It gives
Right (False,True) with parsec-3.0.x while sho
* Yves Parès [2010-03-23 13:46:25-0700]
> Is there a way to perform some kind of remote method invocation in haskell?
> (Or, "remote object", but I prefer not to use this term, as there are no
> "objects" strictly speaking in Haskell)
> I would like to use a higher level API than sockets for netwo
* Eugene Dzhurinsky [2010-05-16 18:42:08+0300]
> Hello all!
>
> Can somebody please explain wha am I doing in wrong way?
>
> [snip]
>
> I am getting the output:
>
> ===
> 1) 345 =K=G5 <>4=> 1...@0bl :=86:8 2 2845 FB2?
>
> 2) :0:>9 5A
* Andrew Coppin [2010-06-03 08:27:21+0100]
> I've had a hunt around in System.Process, but I can't discover any
> way to adjust the priority of the process you just spawned. Am I
> missing something, or has this just not been implemented yet? (I must
> confess, I don't know whether Windows and Uni
* aditya siram [2010-06-03 22:30:33-0500]
> Hi all,
> I had an issue where using the connectTo [1] function would fail to
> connect to "localhost" if my wireless card was turned off. The moment
> I turned on my wireless connection it worked. But if I use connectTo
> with "127.0.0.1" [2] with my ne
Another way round -- "it" (the server) was only listening on IPv4 and
the (Haskell) client only tried to connect via IPv6.
The bug is described here (with a patch):
http://trac.haskell.org/network/ticket/30
* Jeremy Shaw [2010-06-04 16:57:38-0500]
> Perhaps it was only listening on IPv6 ? ::1 ?
* Andrew Coppin [2010-06-10 18:47:23+0100]
> I just visited haskell.org and noticed that the old logo is back.
> Anybody know when/why this happened?
Result of restoring from backups?
--
Roman I. Cheplyaka :: http://ro-che.info/
"Don't let school get in the way of your education." - Mark Twain
* David Powell [2010-06-11 16:09:55+1000]
> This is a slightly different issue, but isn't there a potential problem with
> threadDelay? I noticed that internally threadDelay uses gettimeofday() as
> the absolute time source (on linux at least). Isn't there potential
> problem with this since wa
* Günther Schmidt [2010-06-11 01:22:27+0200]
> there is nothing wrong with ifs as such except the won't actually
> exit a long piece of code, the computation will continue, just in a
> useless way.
Can you clarify?
--
Roman I. Cheplyaka :: http://ro-che.info/
"Don't let school get in the way of
* C K Kashyap [2010-06-13 22:45:44+0530]
> Hi,
> I am trying to write a routine that would generate a graph - where each
> vertex would be a string.
>
> type Graph v = [(v,[v])] -- list of tuples of vertices and adjacent
> vertices list
>
> addEdgeToGraph :: Graph -> String -> String -> Graph
>
Suppose I have some parser 'p'. I want to parse it as well as get its
span in the text. So I could write
\begin{code]
pWithLocation = do
loc_start <- getPosition
pval <- p
loc_end <- getPosition
return (pval,loc_start,loc_end)
\end{code}
except that loc_end gives me the location _after_ '
* Antoine Latter [2010-06-13 16:47:28-0500]
> On Sun, Jun 13, 2010 at 4:17 PM, Roman Cheplyaka wrote:
> > Suppose I have some parser 'p'. I want to parse it as well as get its
> > span in the text. So I could write
> >
> > \begin{code]
> > pWith
* Emmanuel Castro [2010-06-15 00:10:09+0200]
> I am looking for the name of the property linking two functions f and g
> when :
> [f(a),f(b),f(c)] = g([a,b,c])
>
> Is there a standard name?
>
> In practice, g is an optimised version of f when working on large
> amount of elements.
Sometimes (pa
* aditya siram [2010-06-15 19:47:37-0400]
> Hi all,
> Haskell is a great language and in a lot of ways it still hasn't found a
> niche, but that's part of what is great about it.
>
> But I wanted to ask people are more experienced with Haskell - what kinds of
> problems is it unsuited for? Have y
I'm trying to optimize the following program:
http://github.com/feuerbach/particles/blob/303c8a17c9b732e22457b5409bdce4b7520be94a/run.hs
Of course general suggestions are welcome (BTW I'm going to give a try
to vector), but currently I'm concerned with two questions:
1. Heavy allocations in 'dist
* Roman Cheplyaka [2010-06-17 12:40:59+0300]
> I'm trying to optimize the following program:
> http://github.com/feuerbach/particles/blob/303c8a17c9b732e22457b5409bdce4b7520be94a/run.hs
>
> Of course general suggestions are welcome (BTW I'm going to give a try
> to v
* Daniel Fischer [2010-06-17 16:27:01+0200]
> On Thursday 17 June 2010 11:43:09, Roman Cheplyaka wrote:
> > * Roman Cheplyaka [2010-06-17 12:40:59+0300]
> >
> > > I'm trying to optimize the following program:
> > > http://github.com/feuerbach/part
While ghc 6.12 finally has proper locale support, core packages (such as
unix) still use withCString and therefore work incorrectly when argument
(e.g. file path) is not ASCII.
Is someone already working on this? If it's just a matter of time and
manpower I can help but I need some guidance from a
* Jason Dagit [2010-06-24 20:52:03-0700]
> On Sat, Jun 19, 2010 at 1:06 AM, Roman Cheplyaka wrote:
>
> > While ghc 6.12 finally has proper locale support, core packages (such as
> > unix) still use withCString and therefore work incorrectly when argument
> > (e.g.
* Jason Dagit [2010-06-25 10:09:21-0700]
> On Thu, Jun 24, 2010 at 11:42 PM, Roman Cheplyaka wrote:
>
> > * Jason Dagit [2010-06-24 20:52:03-0700]
> > > On Sat, Jun 19, 2010 at 1:06 AM, Roman Cheplyaka
> > wrote:
> > >
> > > > While ghc 6.12
* Brandon S Allbery KF8NH [2010-06-25 05:00:08-0400]
> On 6/25/10 02:42 , Roman Cheplyaka wrote:
> > * Jason Dagit [2010-06-24 20:52:03-0700]
> >> On Sat, Jun 19, 2010 at 1:06 AM, Roman Cheplyaka wrote:
> >>> While ghc 6.12 finally has proper locale support, cor
* Paul Keir [2009-05-29 10:47:26+0100]
> Hi all,
>
> GHC is not happy with this:
>
> f = [] == []
>
> nor this:
>
> f' = ([]::(Eq a) => [a]) == ([]::(Eq a) => [a])
Here, there's no guarantee that the answer will be the same independent
of what 'a' you choose. Potentially, you could define dif
* Magicloud Magiclouds [2009-06-14
17:30:33+0800]
> Hi,
> I use gtk2hs in linux. Well, I have no idea how to install gtk2hs by
> cabal, but my program needs it, and I want my program cabalized. So
> how to do this?
> Thanks.
gtk2hs consists of several cabal packages, e.g. gtk, glib and so on.
* Deniz Dogan [2009-06-13 16:17:57+0200]
> I remember needing a non-strict sum at least once, but I do not
> remember the exact application.
We may agree that lazy sum is sometimes (rarely) needed, but then it can
be always written as fold. However, in most cases user wants strict sum.
So it's n
Installation of gtk2hs registers these packages for you.
Again, check `ghc-pkg list gtk`. If you installed gtk2hs, it must be
there. If you, say, upgraded your ghc after you installed gtk2hs, you
have to reinstall gtk2hs.
> How to register my manual-installed gtk2hs to cabal?
>
> On Sun
n, Jun 14, 2009 at 6:52 PM, Roman Cheplyaka wrote:
> > * Magicloud Magiclouds [2009-06-14
> > 18:48:26+0800]
> >> My gtk2hs is install manually, `configure && make && make install`. So
> >
> > It's okay.
> >
> >> when I add gtk
* Brandon S. Allbery KF8NH [2009-07-11 17:01:35-0400]
> On Jul 11, 2009, at 14:31 , Jeremy Yallop wrote:
>> Why does compiling the following program give an error?
>>
>>> {-# LANGUAGE TypeFamilies, RankNTypes #-}
>>>
>>> type family TF a
>>>
>>> identity :: (forall a. TF a) -> (forall a. TF a)
>>>
* Yusaku Hashimoto [2009-07-31 22:56:57+0900]
> Hi,
>
> I'm pleased to announce the release of tkhs-0.1.*, Simple presentation
> utility. If you are thinking PowerPoint is overkill for your
> presentation,
> Tkhs may fit the purpose.
For real presentations one would probably use beamer or simil
* zaxis [2009-09-10 00:51:21-0700]
>
> thanks for your quick answer!
>
> As I understand foldr (\x g -> g . (`f`x)) id xs will return a function
> such as (`f` 3).(`f` 2).(`f` 1) . You have already made it clear ! However,
> why does the "step" function below has three parameters ? I think
* Peter Verswyvelen [2009-09-10 14:43:10+0200]
> On Thu, Sep 10, 2009 at 11:47 AM, Roman Cheplyaka wrote:
> > step x g a = g (f a x)
> >
> > is, thanks to currying, another way to write
> >
> > step x g = \a -> g (f a x)
>
> I thought currying just
* Duncan Coutts [2009-09-10 20:43:54+]
> A personal favourite of mine is having the GUI event handler post data
> over a channel to a thread. That thread reads from the channel and deals
> with the events. The state of the GUI app is then held as local
> parameters in that thread.
>
> Doing t
* Ben Sinclair <[EMAIL PROTECTED]> [2008-01-16 22:02:40+1100]
> If anybody has already used libmpd-haskell (the darcs repo version)
> or would like to look over it I would appreciate their comments.
>
> Thanks,
> Ben
>
> http://turing.une.edu.au/~bsinclai/code/libmpd-haskell/
I'd like to use i
* Don Stewart <[EMAIL PROTECTED]> [2008-01-17 08:56:14-0800]
> roma:
> > * Ben Sinclair <[EMAIL PROTECTED]> [2008-01-16 22:02:40+1100]
> > > If anybody has already used libmpd-haskell (the darcs repo version)
> > > or would like to look over it I would appreciate their comments.
> > >
> > > Than
* Stephen Tetley [2010-06-29 12:02:45+0100]
> The "Applicative Programming with Effects Paper" has the "monodial
> accumulating" applicative instance on a sum type Conor McBride and
> Ross Paterson call Except:
>
> data Except err a = OK a | Failed err
>
> The names are nice and to the point, bu
* Vo Minh Thu [2010-06-29 16:26:06+0200]
> 2010/6/29 Roman Cheplyaka :
> > * Stephen Tetley [2010-06-29 12:02:45+0100]
> >> The "Applicative Programming with Effects Paper" has the "monodial
> >> accumulating" applicative instance on a sum type C
* Vasili I. Galchin [2010-07-02 23:51:09-0500]
> Hello,
>
> Suppose I have the following fragment of a posting:
>
>
> Message: 3
> Date: Fri, 2 Jul 2010 12:32:43 -0500
> From: aditya siram
> Subject: Re: [Haskell-cafe] How easy is it to hire Haskell programmers
> To: Andrew Coppin
> Cc:
* Andrew Coppin [2010-07-03 14:20:14+0100]
> In my experience, using more than one monad transformer at once makes
> code utterly incomprehensible.
See X monad (xmonad) for an counterexample.
-- | The X monad, 'ReaderT' and 'StateT' transformers over 'IO'
-- encapsulating the window manager conf
* Andrew Coppin [2010-07-03 15:07:17+0100]
> Roman Cheplyaka wrote:
> >* Andrew Coppin [2010-07-03 14:20:14+0100]
> >>In my experience, using more than one monad transformer at once makes
> >>code utterly incomprehensible.
> >
> >See X monad (xmonad) f
* Simon Marlow [2010-07-06 13:00:36+0100]
> The Haskell 2010 report is done! I've uploaded it to
> www.haskell.org, and linked it from the main Haskell wiki:
>
> http://www.haskell.org/haskellwiki/Language_and_library_specification
>
> online HTML version:
>
> http://www.haskell.org/online
* Michael Snoyman [2010-09-17 08:47:02+0200]
> * OpenID. Fixes the extra password problem, but doesn't give us any
> extra information about the user (email address, etc).
This is a popular misconception. As was noted on this thread, many
OpenID provideers may provide you an email or other inform
On Mon, 11 Oct 2010 11:54:12 +0100, Magnus Therning
wrote:
> On Mon, Oct 11, 2010 at 08:37, Michael Snoyman
wrote:
> [...]
>> Also, now 10 random profiles will be displayed on the homepage. Only
>> "verified users" will be displayed here. I'm also considering adding a
>> new status as well: real
On Mon, 11 Oct 2010 13:09:00 +0200, Vo Minh Thu wrote:
> 2010/10/11 Roman Cheplyaka :
>> On Mon, 11 Oct 2010 11:54:12 +0100, Magnus Therning
>> wrote:
>>> On Mon, Oct 11, 2010 at 08:37, Michael Snoyman
>> wrote:
>>> [...]
>>>> Also, now 10 rand
On Mon, 11 Oct 2010 13:14:21 +0100, John Lato wrote:
>>
>> From: Michael Snoyman
>>
>> Also, now 10 random profiles will be displayed on the homepage. Only
>> "verified users" will be displayed here. I'm also considering adding a
>> new status as well: real picture, so that only people with real
Since Parsec 2 and Parsec 3 are usually considered to be different
packages, it's ambiguous to say that 'parsec' is included in Haskell
Platform [1].
Could someone please:
1. Clarify which version(s) are included?
2. Fix the page [1]
It would be convenient to have a page which would list all
* Mark Spezzano [2010-10-30 15:37:30+1030]
> Can somebody please explain exactly how the monad functions "sequence"
> and "sequence_" are meant to work?
The others in this thread have already explained how these functions
work, so I'll just give an example how they are used.
Consider the followi
* Patrick Perry <[EMAIL PROTECTED]> [2008-08-28 04:24:21-0700]
> Hi everyone,
>
> I've started on bindings for the random number generators and random
> distributions provided by the gsl. The package is available here:
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gsl-random
>
> I
* Johannes Waldmann <[EMAIL PROTECTED]> [2008-08-29 15:39:15+0200]
> > data Test = Test Integer {b::String}
>
> positional (= unnamed) record notation is a language design error :-)
> and its use should be discouraged. - J.W.
Polluting namespace with unneeded functions should not be encouraged
ei
* Duncan Coutts <[EMAIL PROTECTED]> [2008-09-20 16:37:08+0100]
> If you want to follow the progress we will be using the existing ghc
> development mailing list:
> http://www.haskell.org/mailman/listinfo/cvs-ghc
>
> and a corner of the ghc development wiki:
> http://hackage.haskell.org/trac/ghc/wi
I have a C function whose behaviour is customized by user-supplied
function (think of libc qsort). Typically these user-supplied functions
are written in C, but I'd like to use FFI to write them in Haskell.
Precisely, I'd like to write high-order function which will generate
these functions (e.g. m
* Mark Wassell <[EMAIL PROTECTED]> [2008-11-09 10:51:55+1100]
> Has anyone thought about or embarked on the task of developing a 2D or
> 3D physics engine purely in Haskell?
>
> There is Hipmunk but I'm wondering about a purely Haskell
> implementation; possibly a port of Chipmunk to Haskell.
* Gwern Branwen <[EMAIL PROTECTED]> [2008-12-05 18:18:48-0500]
> Hi everyone. So today I finally got around to something long on my
> todo list - a compilation of all the Haskell haikus I've seen around!
>
> It is at http://haskell.org/haskellwiki/Haiku
>
> But I'm afraid I only have 5, and Googl
* Neil Mitchell <[EMAIL PROTECTED]> [2008-12-08 08:29:03+]
> > Apart from this, HSE now also parses any unrecognized pragma in option
> > (e.g. LANGUAGE), declaration (e.g. RULES) or expression (e.g. SCC)
> > position, allowing user-customized pragmas. Unrecognized pragmas in
> > other position
* Oscar Picasso [2008-12-26 22:37:26-0500]
> Hi,
>
> I can write:
> *Main> let yes = not . not
> *Main> :t yes
> yes :: Bool -> Bool
>
> But not:
> *Main> let isNotEqual = not . (==)
>
> :1:23:
> Couldn't match expected type `Bool'
>against inferred type `a -> Bool'
> Probab
* Roman Cheplyaka [2008-12-27 11:33:22+0200]
> * Oscar Picasso [2008-12-26 22:37:26-0500]
> > Hi,
> >
> > I can write:
> > *Main> let yes = not . not
> > *Main> :t yes
> > yes :: Bool -> Bool
> >
> > But not:
> > *Main&g
Here is a program which illustrates an unexpected behaviour:
import Graphics.PDF
main = runPdf "bug.pdf" standardDocInfo (PDFRect 0 0 100 100) pdf
where
pdf = do
p <- addPage Nothing
drawWithPage p $ drawText $
sequence $ replicate 10 $
Thanks for helping!
* alpheccar [2009-01-06 19:47:21+0100]
> Roman,
>
> Here is the source code to do what you want:
>
> import Graphics.PDF
> import Complex
>
> main = runPdf "bug.pdf" standardDocInfo (PDFRect 0 0 100 100) pdf
> where
> pdf = do
> p <- addPage Nothing
> d
* Andrew Hunter [2009-01-12 13:41:03-0800]
> On Mon, Jan 12, 2009 at 12:57:57PM -0800, Judah Jacobson wrote:
> > I'm pleased to announce the first release of ghci-haskeline. This
> > package uses the GHC API to reimplement ghci with the Haskeline
> > library as a backend. Haskeline is a library
* Martijn van Steenbergen [2009-10-14
20:35:06+0200]
> Dear café,
>
>> {-# LANGUAGE Rank2Types #-}
>> {-# LANGUAGE ImpredicativeTypes #-}
>>
>> type Void = forall a. a
>>
>> newtype Mono a = Mono { runMono :: [Void] }
>>
>> beep :: Mono a -> Mono a
>> beep (Mono vs) = Mono (map undefined vs)
>
>
Cool, I'm in! (Also inspired by [1]this post by Erik de Castro Lopo)
It would be nice to keep track of participants somewhere, so that each
of us knows he's not alone :)
1. http://www.mega-nerd.com/erikd/Blog/CodeHacking/DDC/hacking_ddc.html
* Simon Marlow [2009-11-16 16:29:46+]
> Help us
* Don Stewart [2009-11-30 13:01:11-0800]
> mlesniak:
> > Hello,
> >
> > In terms of
> >
> > "to become a great programmer, you need to read great programs"[1]
> >
> > what are "great" programs written in Haskell (for your personal
> > definition of great), which source code is freely availabl
Imagine some system with hard memory bound (e.g. 64M of physical memory,
no swap). I don't want some accidental laziness (maybe even not in my
code, but in some used package) to crash my program.
So, let's think what we can do at runtime. Suppose RTS takes the parameter --
upper limit of consumed
I am pleased to announce the first public release of haskell-names, a
name resolution library for haskell-src-exts AST.
Namely, it can do the following:
* for a module, compute its interface, i.e. the set of entities
exported by the module, together with their original names.
* for each
* Andrew Cowie [2013-06-21 16:12:55+1000]
> On Thu, 2013-06-20 at 18:13 +0300, Roman Cheplyaka wrote:
> > Namely, it can do the following:
> >
> > * for a module, compute its interface, i.e. the set of entities
> > exported by the module, togethe
* Nikita Karetnikov [2013-07-03 15:50:16+0400]
> > Perhaps you can use `catches` [0]?
>
> Maybe, but my idea is to replace 'syncExceptions' with a similar
> function. Otherwise, it'll be necessary to change (at least) all
> functions that use 'syncExceptions'. I'd like to avoid that.
Here you
* Nikita Karetnikov [2013-07-06 20:12:58+0400]
> > Here you go:
>
> > import Control.Exception
> > import Data.Typeable
>
> > syncExceptions :: SomeException -> Maybe SomeException
> > syncExceptions e
> > | Just _ <- cast e :: Maybe AsyncException = Nothing
> > | otherwise = Jus
Hi Fredrik,
First, do you use the latest parsec version (3.1.3)? If not, can you try
the same with 3.1.3?
Second, please upload your code to hpaste.org or a similar service and
give us the link. It's not much fun to extract code from an html email.
Roman
* Fredrik Karlsson [2013-07-08 23:54:17
h/5955045
>
> Fredrik
>
>
>
>
> On Tue, Jul 9, 2013 at 12:08 AM, Roman Cheplyaka wrote:
>
> > Hi Fredrik,
> >
> > First, do you use the latest parsec version (3.1.3)? If not, can you try
> > the same with 3.1.3?
> >
> > Second, please
The compiler defaults the kind of 'quality' (i.e. the first argument of
QUALITIES) to *, not being able to infer it from the class definition
itself (and other definitions that it references).
Since you want it to have kind * -> *, you should enable KindSignatures
and add an annotation, or otherwi
As Dan said, this behaviour is correct.
The confusing thing here is that in case expressions guards are attached
to the patterns (i.e. to the lhs), while in let expressions they are
attached to the rhs.
So, despite the common "Just x | x > 0" part, your examples mean rather
different things.
Her
* Vlatko Basic [2013-07-11 19:33:38+0200]
> Hello Cafe,
>
> I have
>
> data CmpFunction a = CF (a -> a -> Bool)
>
> that contains comparing functions, like ==, <, > ..., and I'm trying
> to declare the Show instance for it like this
>
> instance Show (CmpFunction a) where
> show
* martin [2013-07-12 08:33:54+0200]
> Hello all,
>
> I have a type ("Mail") which consists of hash and a list, where the hash
> keeps some redundant data of the list for faster access. I can add and
> remove elements to values of this type using custom functions, called
> push and pop.
>
> Now I
Well, in your case, you need not 'from', but 'to', in order to convert
from a generic representation to yours.
Take a look at how a similar task is done in SmallCheck:
https://github.com/feuerbach/smallcheck/blob/master/Test/SmallCheck/Series.hs#L180
https://github.com/feuerbach/smallcheck/blob/ma
* Evan Laforge [2013-07-12 14:25:00-0400]
> So haddock ignores {-# LANGUAGE CPP #-}, which makes it crash on any
> file that uses it.
I'm pretty sure it's not true in general.
If you click on the "Source" link at this haddock page:
http://hackage.haskell.org/packages/archive/smallcheck/0.6.2/do
* martin [2013-07-13 10:10:39+0200]
> Am 07/12/2013 09:18 AM, schrieb Roman Cheplyaka:
>
> > QuickCheck's Gen is a functor. So you can generate a list, and then
> > use fmap to add a hash to it.
> >
> > instance Arbitrary HashedList where
> >
This is not true either. Cabal preprocesses files that explicitly
indicate (via an extension) that they need to be preprocessed.
For example, a .cpphs file will be preprocessed to yield an .hs file.
.hs files are never preprocessed by Cabal, as far as I can tell.
If you have an .hs file with {-#
* Brian Lewis [2013-07-13 14:30:01-0500]
> I maintain a library that, on Linux, needs libXxf86vm to build. The
> server where Hackage runs doesn't have that library, so the build fails.
> I think this is reasonable -- that box can't possibly have all the
> libraries various packages might need. Bu
* Brian Lewis [2013-07-13 15:44:58-0500]
> On 2013.07.13, at 23:15, Roman Cheplyaka wrote:
> > 1. Why exactly does haddock fail?
>
> I think it never actually tries to build the Haddock docs for the actual
> package of interest because its dependencies failed to build.
>
Forgot to mention — a good explanation of GHC Generics is the paper
"A Generic Deriving Mechanism for Haskell".
Roman
* Roman Cheplyaka [2013-07-14 18:21:58+0300]
> Hi,
>
> (Redirecting this back to cafe to keep it discoverable — hope you don't
> mind.)
>
> *
Something like that should definitely be included in Data.List.
Thanks for working on it.
Roman
* Niklas Hambüchen [2013-07-14 19:20:52+0800]
> tldr: nub is abnormally slow, we shouldn't use it, but we do.
>
>
> As you might know, Data.List.nub is O(n²). (*)
>
> As you might not know, almost
s, which I would need too...
It provides the types of the constructor fields through the Typeable
class, which may or may not be sufficient for your needs... Anyway,
you're right in that it is a completely different approach.
Roman
> On Fri, Jul 12, 2013 at 10:57 AM, Roman Cheplya
Think about this: if you always take only the first element, why do you
need lists at all?
Roman
* C K Kashyap [2013-07-24 19:56:29+0530]
> Dear Cafe,
>
> I am trying to implement[1] parsec in go using the "Monadic Parser
> Combinators" paper [2] . I've been able to implement "plus" "bind" and
t use it like Maybe? I'd like it very much if I could get
> an example of a missed match by not using the complete match.
>
> regards,
> Kashyap
>
> Sent from my Windows Phone
> From: Roman Cheplyaka
> Sent: 24/07/2013 8:19 PM
> To: C K Kashyap
> Cc: Haskell Cafe
Can withAsync guarantee that its child will be terminated if the thread
executing withAsync gets an exception?
To remind, here's an implementation of withAsync:
withAsyncUsing :: (IO () -> IO ThreadId)
-> IO a -> (Async a -> IO b) -> IO b
-- The bracket version works, but is
* Bertram Felgenhauer [2013-07-28
18:11:54+0200]
> Roman Cheplyaka wrote:
> > Can withAsync guarantee that its child will be terminated if the thread
> > executing withAsync gets an exception?
> >
> > To remind, here's an implementation of withAsync:
> >
Hi Mateusz,
This looks great — I'm especially excited about "List entries no longer
have to be separated by empty lines"!
However, the decision to use Attoparsec (instead of Parsec, say) strikes
me as a bit odd, as it wasn't intended for parsing source code. In
particular, I'm concerned with erro
That's because types that belong to most non-star kinds cannot have
values.
data Foo (a :: k) = Foo
is okay,
data Foo (a :: k) = Foo a
is bad because there cannot be a field of type a :: k.
So no, no useful examples exist, because you wouldn't be able to use
such a data constructor even if
* Malcolm Wallace [2013-08-04 09:33:22+0100]
>
> On 3 Aug 2013, at 21:03, Jason Dagit wrote:
>
> > Another con of using parsec that I forgot to mention in my previous
> > email is that with Parsec you need to be explicit about backtracking
> > (use of try). Reasoning about the correct places to
I am pleased to announce the first release of tasty, a new testing
framework for Haskell. It is meant to be a successor to test-framework
(which is unmaintained).
Tasty supports HUnit, SmallCheck, QuickCheck, and golden tests out of
the box (through the standard packages), but it is very extensibl
* Andrey Chudnov [2013-08-05 15:31:16-0400]
> On 08/05/2013 02:48 PM, Roman Cheplyaka wrote:
> >(which is unmaintained).
> Has this been confirmed by the author/maintainer?
I've sent a couple of emails to Max (one in January, one in April) and
haven't heard anything from
* Carter Schonwald [2013-08-05 16:58:37-0400]
> fair enough. I take it that you're also (implicitly) committing to
> maintaining this for the next few years? :)
That's correct.
Roman
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.ha
mework.)
>
> It would be awesome to see an example .cabal file along with your example
> test cases.
>
> thanks,
> -tikhon
>
>
> On Tue, Aug 6, 2013 at 1:53 AM, Roman Cheplyaka wrote:
>
> > * Carter Schonwald [2013-08-05 16:58:37-0400]
> > > fair
* John Wiegley [2013-08-06 13:40:50-0500]
> >>>>> Roman Cheplyaka writes:
>
> > I am pleased to announce the first release of tasty, a new testing framework
> > for Haskell. It is meant to be a successor to test-framework (which is
> > unmaintained).
>
passed 100 tests (29% Short)
>
> Can tasty display this classification info? That was a thing I missed a lot
> in test-framework and would probably motivate me to switch to tasty.
>
> Janek
>
> ----- Oryginalna wiadomość -
> Od: "Roman Cheplyaka"
> Do:
Hi,
You can easily do this using the haskell-names library. See
http://documentup.com/haskell-suite/haskell-names
Roman
* Jong-won Choi [2013-08-08 12:34:44+1000]
> Hi,
>
> I asked this question to beginner mailing list and no luck so far, so
> I'm trying here.
>
> How can I get all the modul
* Magnus Therning [2013-08-08 07:59:37+0200]
> On Mon, Aug 05, 2013 at 09:48:39PM +0300, Roman Cheplyaka wrote:
> > I am pleased to announce the first release of tasty, a new testing
> > framework for Haskell. It is meant to be a successor to
> > test-framework (
* Eduardo Sato [2013-08-07 14:46:02-0300]
> Hello, guys. Has anybody tried to install wxhaskell on Snow Leopard?
>
> I followed these instructions:
> http://www.haskell.org/haskellwiki/WxHaskell/Mac , but got an error:
>
> src/haskell/Graphics/UI/WXCore/WxcClassesAL.hs:13085:1:
> Unaccepta
1 - 100 of 420 matches
Mail list logo
