On Nov 18, 9:49 pm, Robert Greayer robgrea...@gmail.com wrote:
On Wed, Nov 18, 2009 at 3:10 PM, levi greenspan.l...@googlemail.com wrote:
On Nov 18, 8:18 pm, Luke Palmer lrpal...@gmail.com wrote:
You know, another solution to the records problem, which is not quite
as convenient but much
|* General Type Directed Name Resolution (GTDNR):
|For every function application f x in the program where f is a
|name, f is resolved based on the type of the argument x.
|
...
| You suggest that GTDNR might not be a good idea, well why not? One
| reason is that it can
jmillikin wrote:
The GNOME Keyring is a service for securely storing per-user secret
information, such as passwords and encryption keys, on the GNOME
desktop. This library is a binding to the libgnome-keyring C library.
The API is still a bit too slave-ish to the original for my taste,
On behalf of the many, many contributors, I am pleased to announce
that the
Haskell Communities and Activities Report
(17th edition, November 2009)
http://www.haskell.org/communities/
is now available from the Haskell Communities home page in PDF
Hi,
Anyone knows a good library for graph diagram drawing? Or a haskell
binding for one?
Something like jgraph. http://www.jgraph.com/jgraph.html
[]s'
Victor
--
GNU/Linux user #446397 - http://counter.li.org
___
Haskell-Cafe mailing list
I have had some luck with the graphviz (dotter) bindings for drawing
node/ark graphs. It's not an ideal solution, and will require some wrappers
to bind to your data structures, but it does work.
Matthew
2009/11/20 Victor Mateus Oliveira rhapso...@gmail.com
Hi,
Anyone knows a good library
On Fri, Nov 20, 2009 at 1:57 PM, Victor Mateus Oliveira
rhapso...@gmail.com wrote:
Hi,
Anyone knows a good library for graph diagram drawing? Or a haskell
binding for one?
Something like jgraph. http://www.jgraph.com/jgraph.html
I usually turn to graphviz for my Haskell graphing needs.
/M
GTDNR is what I really want anyway... whether or not it's possible. :-)
At any given time, importing everything unqualified from every module used by a
typical hs leads only to a handful of ambiguities. While the general case might
be intractable, real-world cases might be trivial.
Regards,
Maurício CA wrote:
I believe I forgot to write a section with that information, as
well as others one would like to know from start. I wrote a new
section trying to fix that in 'how to use it' topic.
http://bitbucket.org/mauricio/bindings-dsl/wiki/HowToUseIt
Very nice. I think that is clear
You know, another solution to the records problem, which is not quite
as convenient but much simpler (and has other applications) is to
allow local modules.
module Foo where
module Bar where
data Bar = Bar { x :: Int, y :: Int }
module Baz where
data Baz = Baz { x :: Int, y ::
I am writing a binary data parser and use `iteratee' package.
The following pattern appears quite often in my code:
results - map someConversion `liftM` replicateM nbytes Iter.head
The meaning is: take `nbytes' from stream, apply `someConversion' to
every byte and return the list of `results'.
I've written a simple incomplete binding to graphviz-as-a-library to
do in-process graphviz layouts, though I would say it's hardly
complete so I haven't released it. If it's useful to someone and they
want to put in some additional elbow grease to make the particular
features they want
I'm looking for something more integrated with a gui library. The
jgraph integrates with swing, so you can move, create, delete, have
popup menus, select nodes, and so on.
I haven't found yet.. If there isn't, I thinking in create one lib
with wxHaskell using wxDC... But by now, I really prefer
I'm not keen on gtk2hs in general -- it's quite monolithic, which
makes it difficult to 1) install (via Cabal) and 2) develop. Ideally,
GTK+ bindings would be available on Hackage in separate packages (like
gtk, gnome-vfs, gconf, etc), and would be developed in separate
repositories to avoid
After reading several recent papers I came to the understanding that
there isn't consensus on the name of Applicative Functors. Several
prefer to call them idioms:
'Idiom' was the name McBride originally chose, but he and Paterson
now favour the less evocative term `applicative functor'. We have
David Sankel wrote:
After reading several recent papers I came to the understanding that
there isn't consensus on the name of Applicative Functors. Several
prefer to call them idioms:
'Idiom' was the name McBride originally chose, but he and Paterson
now favour the less evocative term
On Fri, Nov 20, 2009 at 2:58 PM, Twan van Laarhoven twa...@gmail.com wrote:
David Sankel wrote:
I'm writing a set of classes that includes AF's and I'm trying to
decide whether to call the class Idiom. Anyone have more information
on this question?
Why are you writing your own? How do your
Victor Mateus Oliveira wrote:
I'm looking for something more integrated with a gui library. The
jgraph integrates with swing, so you can move, create, delete, have
popup menus, select nodes, and so on.
I haven't found yet.. If there isn't, I thinking in create one lib
with wxHaskell using
-- Forwarded message --
From: Ravi Nanavati rav...@alum.mit.edu
Date: Fri, Nov 20, 2009 at 4:00 PM
Subject: Next meeting: November 24th at MIT (32-G882)
To: bostonhask...@googlegroups.com
I'm pleased to announce the November meeting of the Boston Area
Haskell Users' Group.
Based
On Thu, 19 Nov 2009 04:54:13 +0100 Daniel Fischer daniel.is.fisc...@web.de
wrote:
DF h :: Num a = a - [a] - [a]
DF h x (y:ys)
DF | x+1 == y = x:ys
DF h x zs = x:(x+1):zs
DF invlist = foldr h []
ghci invlist [2,3,4,5,8,9,10]
DF [2,6,8,11]
ghci invlist [4]
DF [4,5]
ghci invlist
20 matches
Mail list logo
