On 28 April 2012 11:34, Christian Höner zu Siederdissen
wrote:
> Hi,
>
> one minor correction:
>> This probably won't be of many use to people
> for bioinformatics I'd disagree ;-) I'll take a look at your library.
>
> (for example, RNA /secondary/ structure forms a planar graph)
I stand correcte
On 28 April 2012 11:38, Felipe Almeida Lessa wrote:
> Hello!
>
> I'm sorry if this is a dumb question, I was just reading the API docs,
> but: what happens if one by one I add all edges of a non-planar graph
> using addEdge? Are there any sanity checks that would tell me "sorry,
> but your graph
Hello!
I'm sorry if this is a dumb question, I was just reading the API docs,
but: what happens if one by one I add all edges of a non-planar graph
using addEdge? Are there any sanity checks that would tell me "sorry,
but your graph isn't planar", or would it just give me wrong answers?
Cheers,
On 4/26/12 3:52 PM, Roman Cheplyaka wrote:
* Tillmann Rendel [2012-04-26 21:34:21+0200]
Hi,
Sjoerd Visscher wrote:
Just as there's a Foldable class, there should also be an Unfoldable class.
This package provides one:
class Unfoldable t where
unfold :: Unfolder f => f a -> f (t
Good work, Ivan. Despite your numerous previous pointers, I still
haven't look at this API. I'm glad to see this release, it's great
motivation and I'll probably look through it this weekend.
Thanks for all the graph library work you do,
Thomas
On Fri, Apr 27, 2012 at 4:07 PM, Ivan Lazar Miljen
I uploaded this [1] yesterday, posted the blog article [2] about it...
but forgot to send a message to the lists!
[1]: http://hackage.haskell.org/package/planar-graph
[2]: http://ivanmiljenovic.wordpress.com/2012/04/27/announcing-planar-graph/
planar-graph is an implementation of, strangely enoug
Hi Derek,
Thanks for your comments. Yes, I am probably going to focus on making
it work as a web service and stay away from platform-specific mobile
apps. Not been thinking mobile much at all, since the quantities of
data are taxing even to my laptop, and also I'm inclined to believe
people are mo
On Wed, Apr 25, 2012 at 06:57:14PM -0700, Thomas DuBuisson wrote:
> On Wed, Apr 25, 2012 at 5:27 PM, Antoine Latter wrote:
> > On Wed, Apr 25, 2012 at 4:59 PM, Thomas DuBuisson
> > wrote:
> >> Warning:
> >>
> >> I, not the maintainer of hsc2hs, will be uploading a trivial fix for
> >> hsc2hs to h
For simple datatypes like this, GHC can derive the Functor implementation
for you:
{-# LANGUAGE DeriveFunctor #-}
data ExprF r =
deriving (..., Functor)
See http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/deriving.html
-- ryan
On Fri, Apr 27, 2012 at 5:40 AM, Stefan Holdermans
Hi, trying to learn haskell and the associated build env.
I come from a java/scala world so trying to understand the how to invoke
tests.
Have a cabal file that invokes a main function to execute a test.
But wondering if there is any automatic discovery of tests as per junit.
I have seen test-fr
Excuse the delay, I have no home internet.
> On Fri, Apr 27, 2012 at 1:16 AM, wrote:
> Great idea. Maybe the format can start as compactly as possible,
> i.e. 1 entry per line to make it easy to browse as many entries
> as possible in one page.
>
> It looks as though disabling just the dependen
On Thu, Apr 26, 2012 at 12:20 AM, Simon Peyton-Jones
wrote:
> Tristan Allwood got quite a long way with this a couple of years ago.
> http://research.microsoft.com/en-us/um/people/simonpj/papers/stack-trace/DebugTraces.pdf
While stack traces are undoubtably useful, I think this is a different
pro
On Thu, Apr 26, 2012 at 5:05 PM, Joachim Breitner
wrote:
> Hi,
>
> Am Mittwoch, den 25.04.2012, 18:36 +0300 schrieb Michael Snoyman:
>> I'm sure there are many better ways to approach the problem, and I
>> can't speak to the complexity of implementation within GHC. I *can*
>> say, however, that th
Romildo,
> I could write the (Functor ExprF) instance:
>
> instance Functor ExprF where
>fmap f expr = case expr of
>Num n -> Num n
>Var v -> Var v
>Bin op x y -> Bin op (f x) (f y)
Yes, excellent. That'll do.
Cheers,
Stefan
_
Romildo,
> How should an instance of (Functor ExprF) be defined? It is not shown in
> the thesis.
It's actually quite straigtforward:
instance Functor ExprF where
fmap _ (Num n) = Num n
fmap _ (Var x) = Var x
fmap f (Bin op l r) = Bin op (f l) (f r)
As expected you get:
On Fri, Apr 27, 2012 at 08:39:23AM -0300, romi...@malaquias.dhcp-GERAL wrote:
> On Thu, Apr 26, 2012 at 10:21:36AM +0200, José Pedro Magalhães wrote:
> > Hi Romildo,
> >
> > If I understand correctly, you now want to add annotations to
> > mutually-recursive datatypes. The annotations package supp
On Thu, Apr 26, 2012 at 10:21:36AM +0200, José Pedro Magalhães wrote:
> Hi Romildo,
>
> If I understand correctly, you now want to add annotations to
> mutually-recursive datatypes. The annotations package supports that.
> Section 8 of our paper [1] gives an example of how to do that, and also
> C
Why do you make your own overlay to download files via HTTP?
HXT has backends (hxt-http or hxt-curl) to do that.
Le 27 avril 2012 04:16, aditya bhargava a écrit :
> *Homepage:* http://egonschiele.github.com/HandsomeSoup
> *On Hackage:* http://hackage.haskell.org/package/HandsomeSoup
>
> *Blurb:*
18 matches
Mail list logo
