On Thu, Oct 27, 2011 at 7:04 AM, Evan Laforge qdun...@gmail.com wrote:
No, this lists all the instances of a class. OP asked for the classes
of which a given type is an instace.
Presumably it is possible, since Haddock does it! In the
documentation generated for a type it lists classes of
On Thu, Oct 27, 2011 at 1:57 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
On Wed, Oct 26, 2011 at 09:10:23PM +0400, MigMit wrote:
Can't be done. Even if this particular module doesn't contain
instance Class Type, it's quite possible that the said instance
would be defined in another module,
Heinrich Hördegen hoerde...@funktional.info wrote:
this evening, Haskeller meet at Cafe Puck at 19h30:
www.haskell-munich.de
May I ask how the evening went? I would love to join, but it's just too
far away from here (Ludwigsburg near Stuttgart) for work days.
Greets,
Ertugrul
--
Thanks, Daniel. That was it.
On Tue, Oct 25, 2011 at 5:15 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Wednesday 26 October 2011, 02:00:49, Captain Freako wrote:
So, do you have any advice for me, with regard to solving this issue:
Implicit import declaration:
Could not
Please advise on Haskell libraries to compare trees in textual
representation.
I need to compare both structure and node contents of two trees, find
similar sub-trees, and need some metric to measure distance between two
trees.
Also need advice on simple parser to convert textual tree
In trying to follow along with `Programming with Arrows' by John
Hughes, I'm entering the following code:
1 -- Taken from `Programming with Arrows'.
2
3 module SF where
4
5 import Control.Arrow
6
7 newtype SF a b = SF {runSF :: [a] - [b]}
8
9 instance Arrow SF where
10 arr
My mistake: need advice on libraries and data types not for trees but for
directed graphs.
On Thu, Oct 27, 2011 at 4:49 PM, dokondr doko...@gmail.com wrote:
Please advise on Haskell libraries to compare trees in textual
representation.
I need to compare both structure and node contents of two
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
SF.hs:11:10: `' is not a (visible) method of class `Arrow'
Failed, modules loaded: none.
In the base package Arrows are defined a bit different from what you
some times see in the literature. I also stumbled over this once. The
() operator is just
On Thu, Oct 27, 2011 at 5:55 AM, Captain Freako capn.fre...@gmail.comwrote:
SF.hs:11:10: `' is not a (visible) method of class `Arrow'
Failed, modules loaded: none.
import Prelude hiding ((.),id)
import Control.Category
you'll also need to define `instance Category SF`, since that is a
Hello cafe,
In the context of the monad-par project we're just getting to the point of
trying to replace our work stealing Deque's with something more efficient
(in Haskell).
Based a quick perusal of Hackage there does not seem to be a lot of work in
this area. Of course, for Haskell the
Hi, Café,
I'm playing with STM a bit, and did a small writeup. As I'm considering
to submit it, uh, tomorrow, I was wondering if anybody would care to
take a look? I'm especially nervous about the accuracy and clarity
of my descriptions of monads and STM, which are terse and written in a
I am trying to understand how to organize my code and edit-compile-run cycles. I can't figure out
how to setup environment in such why that when I build some program using cabal, cabal will rebuild
program dependencies if some was changed. I don't want to configure/build/install manually.
Having
You're missing one of the key insights from A-star (and simple djikstra, for
that matter): once you visit a node, you don't have to visit it again.
Consider a 5x2 2d graph with these edge costs:
B 1 C 1 D 1 E 9 J
1 1 1 1 1
A 2 F 2 G 2 H 2 I
with the start node being A, the target node
Also, this wasn't clear in my message, but the edges in the graph only go
one way; towards the top/right; otherwise the best path is ABCDEHIJ :)
On Thu, Oct 27, 2011 at 10:48 AM, Ryan Ingram ryani.s...@gmail.com wrote:
You're missing one of the key insights from A-star (and simple djikstra,
On Tue, Oct 25, 2011 at 1:46 PM, Ben Franksen ben.frank...@online.dewrote:
IME, there are (at least) two possible problems
here, 1) transactions scale (quadratically, I think) with the number of
TVars touched,
Ouch! What would be the reason for that? I thought it would be linear... I
The main question is: does the STM transaction actually see that I
changed
part of the underlying array, so that the transaction gets re-tried? Or do
I
have to implement this manually, and if yes: how?
The transaction does not detect anything inside the unsafeIOtoSTM. But to
implement
Hi folks,
I just bought a NVidia Fermi-based card and remembered reading a few months
(years?) ago about some effort to accelerate array processing in Haskell
using GPUs.
How is this going on? Any progresses? Do we have GPU based DPH already? (the
last one is a joke...)
I keep thinking on the
On Thu, Oct 27, 2011 at 10:02 AM, Konstantin Litvinenko
to.darkan...@gmail.com wrote:
I am trying to understand how to organize my code and edit-compile-run
cycles. I can't figure out how to setup environment in such why that when I
build some program using cabal, cabal will rebuild program
Hi, there is an OpenCL / Haskell thread floating around the ML, mostly it's
a dew ppl talking about merging the 5 (or so) bindings to the OpenCL api and
getting spiffy multi-threaded haskell-awesomeness out of that. i think they
are discussing the benefits/drawbacks of a pure-ish api conversion
On Thu, Oct 27, 2011 at 1:00 PM, Evan Laforge qdun...@gmail.com wrote:
So as far as I know there isn't really a build system
for larger or cross language haskell repos beyond make (I've played
with waf some, that also might be a possibility).
We use waf to drive cabal. It supports parallel
Hi,
On Thu, Oct 27, 2011 at 8:45 AM, Ryan Newton rrnew...@gmail.com wrote:
Based a quick perusal of Hackage there does not seem to be a lot of work in
this area. Of course, for Haskell the importance of this topic may be
diminished relative to pure data structures, but for doing
Well, for arbitrary directed graphs, FGL is probably your best bet, or
roll-your-own.
_But_ you'll need to write the parser yourself using something like
trifecta, uu-parsinglib, polyparse, parsec, etc.
It would help if you described the structure of these graphs and what
kind of support you'd
Thanks for the reply, David.
I tried implementing your suggestions, such that my code now looks like this:
1 -- Taken from `Programming with Arrows'.
2
3 module SF where
4
5 import Prelude hiding ((.),id)
6 import Control.Category
7 import Control.Arrow
8
9 newtype SF a b = SF
On Thu, Oct 27, 2011 at 7:07 PM, Captain Freako capn.fre...@gmail.comwrote:
Thanks for the reply, David.
I tried implementing your suggestions, such that my code now looks like
this:
While Ross Patterson followed Hughes closely, it was recognized that
Category could be separated from Arrow.
24 matches
Mail list logo
