I've pushed a patch with a minor fix for the recurring query to open a
file:
* Doesn't attempt a background build, when there is no open
package.
* Doesn't keep bugging the user if the session they select does
not have a valid package
* Improved title on package
Ah, I hadn't read Don's thread before posting my previous comment.
That cleared things up for me :)
Thanks!
Duane Johnson
On Mar 30, 2009, at 10:54 PM, Matt Morrow wrote:
I am pleased to announce the release of vacuum, a Haskell library
for extracting graph
representations of values from t
Hi Matt,
That looks pretty neat. Can you explain a little more about what I'm
seeing in these visualizations, and where this kind of visualization
would be most useful? (Debugging, algorithm tuning, etc.)?
Take care,
Duane Johnson
http://blog.inquirylabs.com/
On Mar 30, 2009, at 10:54 PM,
Manlio Perillo wrote:
wren ng thornton ha scritto:
> Manlio Perillo wrote:
> > Since ratings for each customers are parsed "at the same time", using
> > a plain list would consume a lot of memory, since stream fusion can
> > only be executed at the end of the parsing.
> >
> > On the other hand
o...@okmij.org wrote:
wren ng thornton wrote:
> > how, for instance, turn a nested Map like
> >
> > Map Int (Map Int (Map String Double)
> >
> > into a "zipped" version.
> You can't. Or rather, you can't unless you have access to the
> implementation of the datastructure itself; and Data.Map does
David Menendez wrote:
On Tue, Mar 31, 2009 at 11:44 PM, wren ng thornton wrote:
> Another tricky thing for this particular example is answering the question
> of what you want to call the "focus". Usually zippered datastructures are
> functors, so given F X we can pick one X to be the focus and
Hi Martijn and Wouter,
Based on the parser combinators paper, I put a monad together,
> data Parser s t = Parser ([s] -> [(t, [s])])
>
> pFail = Parser (const [])
> pReturn a = Parser (\inp -> [(a, inp)])
> pSymbol s = Parser (\inp -> case inp of x:xs | x == s -> [(s,xs)] ; _ ->
> [])
> pChoice
Abstract: The objective of this project is to create a useful, fast and
feature rich 3D rendering engine in Haskell which supports advanced
rendering features like level of detail, material state sorting, geometry
instancing, scene handling, fast vertex buffer handling and so on. This
would be be
Wed, Apr 1, 2009 at 11:20 PM, Claus Reinke wrote:
> A platform-independent, open-source, 2d/3d graph layout engine
>>
> for incrementally updated graphs (where the graph after the update
> has to be similar enough to the one before that one can follow the
> animation and make sense of the data di
Hi Csaba,
Do you mean you have submitted your proposal to the Haskell wiki
thing, or to the official google application?
If its the wiki, then submit it to the official Google thing as well.
You can always edit it later, but the deadline is fast approaching.
If its the Google thing, then not eve
Not good. If you succeed, this might attract a shitload of hackers like me
to Haskell (as soon as they see that your render engine does about the same
in 1/10th the lines of code...)
And we want to avoid success at all cost :-)
2009/4/2 Csaba Hruska
> Hi!
>
> I've submitted my proposal on gsoc po
Hi!
I've submitted my proposal on gsoc portal. (3D Rendering Engine)
What's your opinion?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Bertram Felgenhauer wrote:
> Ben Franksen wrote:
>> Mark Spezzano wrote:
>> > Just looking at the definitions for foldr and foldl I see that foldl is
>> > (apparently) tail recursive while foldr is not.
>> The point is that foldr still needs to do something (namely to apply (y
>> `k`)) to the resu
Yes, that might be the rumor indeed, it surely sounds like it :)
Darcs is really very different, so it takes a while to get used to it when
coming from other systems.
On Wed, Apr 1, 2009 at 11:25 PM, Claus Reinke wrote:
> Perhaps the rumours refer to non-tagged "versions"? In conventional
> non-d
Oh I checked the docs. But I don't thrust the docs yet, I value the words of
the community higher. Since we're using Darcs to guard our hard work, I
thought I better double check :-)
I'm not really a newbie when it comes to source control actually. I wrote a
full blown version control system mysel
Perhaps the rumours refer to non-tagged "versions"? In
conventional non-distributed version control systems, one
might go back to the version on a specific date, while with
darcs, that only makes sense wrt a specific repo (I think?).
So you can unpull all patches after a date from your local
rep
Did you use hubigraph?
http://ooxo.org/hubigraph/
Ah, there it is, then. Btw, more interesting than the 3d nature of
the visualizations is that Ubigraph seems to have been designed
for incremental updates of the layout (see the paper available
via their home site). The lack of support for th
malcolm.wallace:
>
> On 30 Mar 2009, at 20:16, Andrew Coppin wrote:
>>> Lennart, what is the next language DSL you are going to build?
>>> Prolog? XSLT?
>>
>> Declarative 3D scene construction? ;-)
>
> The ICFP programming contest in year 2000 was to write a ray tracer for a
> given declarative 3D
Peter Verswyvelen wrote:
Okay, thanks. So the rumors about this must be incorrect?
That's one rumor I've never heard. Do drop by #darcs as well, we love
solving easy problems. :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.has
Yes. It would be fairly easy to check this in the docs, too :)
bugfact:
> Okay, thanks. So the rumors about this must be incorrect?
>
> On Wed, Apr 1, 2009 at 9:57 PM, Ketil Malde wrote:
>
> Don Stewart writes:
>
> >> Rumor goes that this is very difficult to do with Darcs. Is this
>
Okay, thanks. So the rumors about this must be incorrect?
On Wed, Apr 1, 2009 at 9:57 PM, Ketil Malde wrote:
> Don Stewart writes:
>
> >> Rumor goes that this is very difficult to do with Darcs. Is this
> correct?
>
> > darcs unpull
>
> Or just cd to a different directory, and darcs get -t ?
On Wed, 1 Apr 2009, Benjamin L.Russell wrote:
Your logo, a lowercase lambda merged with an inverted version of the
same sharing a single spine, loosely resembles an uppercase 'H', and
could possibly serve as a Haskell logo. It is simple, can represent
simultaneously both "lambda" and "Haskell,
On Wed, Apr 1, 2009 at 4:13 PM, Don Stewart wrote:
> Did you use hubigraph?
>
> http://ooxo.org/hubigraph/
>
> This cabalized project doesn't appear to be on hackage!
The same author also has http://ooxo.org/dtwitzen/ and
http://github.com/smly/sys35tools/tree/master
--
gwern
___
Did you use hubigraph?
http://ooxo.org/hubigraph/
This cabalized project doesn't appear to be on hackage!
gleb.alexeev:
> Don Stewart wrote:
>> I am pleased to announce the release of vacuum-cairo, a Haskell library
>> for interactive rendering and display of values on the GHC heap using
>>
2009/4/1 jutaro :
> I guess you mean the dialog which should help leksah to find sources
> for installed packages. It needs this so you can go to all the definitions
> in the base packages ... This is very handy if it works. Look to the manual
> for details.
Maybe could add support to Cabal for in
Hi Jeff,
I just tried it out and it didn't work for me too. So I've released it to
early I guess.
One problem I see is that the background build is even active when no
project is open.
So it always ask you to open a file, and you can't cancel this.
This can be avoided by unselecting the symbol
Hi Neil,
Neil Mitchell wrote:
>
> Hi
>
> Just tried it out, a few notes:
>
> * Very easy install - if only gtk2hs could be installed with cabal it
> would have been perfect.
>
> * Select the package you have installed. I didn't have a clue what to
> do here. Do you mean where I keep my Haske
Don Stewart writes:
>> Rumor goes that this is very difficult to do with Darcs. Is this correct?
> darcs unpull
Or just cd to a different directory, and darcs get -t ?
-k
--
If I haven't seen further, it is by standing in the footprints of giants
_
I have one problem so far (and one segfault), but I like the IDE a
lot. When I create a new package inside one of my current source
directories, it adds all the modules in that directory to *both* the
exposed and additional unexposed modules list, resulting in a net zero
modules in the package. I
On Tue, 2009-03-31 at 01:16 +0300, Vlad Dogaru wrote:
> Hello everyone,
>
> I am writing to judge interest in a Summer of Code proposition: an XML
> Schema[1] implementation, described as a possbile application here[2].
> As both a tool and an inspiration, I intend to use HaXML[3].
> [snip]
Thank
Hi
Just tried it out, a few notes:
* Very easy install - if only gtk2hs could be installed with cabal it
would have been perfect.
* Select the package you have installed. I didn't have a clue what to
do here. Do you mean where I keep my Haskell programs? Or where GHC
installs them? Can't you fig
Thanks Achim,
maybe you are right with Plugins. In the moment I'm more focused on adding
additional features. But wish the day, that so many want to add features
that a plugin system will be essential, we have it.
With the GUI arrangement like splitting etc. leksah is quite flexible, but
it doesn
Please upload!!
moonpatio:
> Holy crap! That looks amazing. I think you should most definitely upload it.
>
> 2009/4/1 Gleb Alexeyev
>
> Don Stewart wrote:
>
> I am pleased to announce the release of vacuum-cairo, a Haskell
> library
> for interactive rendering and display
bugfact:
> Rumor goes that this is very difficult to do with Darcs. Is this correct?
darcs unpull
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Benjamin,
Nice that you like the logo. The idea to turn the lambda around came from
the name of the project. But actually I'm feeling totally incapable of
graphics design and the icons coming with leksah are an example of bitty
plagiarism. So I will definitely not participate in any Logo compet
2009/4/1 Peter Verswyvelen :
> Rumor goes that this is very difficult to do with Darcs. Is this correct?
I've always found it straightforward. Perhaps you should read the
manual http://darcs.net/manual/node8.html#SECTION0089
and try it out for yourself.
--
gwern
_
Holy crap! That looks amazing. I think you should most definitely upload it.
2009/4/1 Gleb Alexeyev
> Don Stewart wrote:
>
>> I am pleased to announce the release of vacuum-cairo, a Haskell library
>> for interactive rendering and display of values on the GHC heap using
>> Matt Morrow's vacuum l
Rumor goes that this is very difficult to do with Darcs. Is this correct?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
My dreams, they will be forever haunted.
2009/4/1 Maarten Hazewinkel
> That's not you usual Koala face.
> Must be a special Simon^H^H^H^H^HHaskell-Koala species.
>
>
>
> On 1 Apr 2009, at 10:07, Simon Peyton-Jones wrote:
>
>
>> Dear Haskell enthusiasts,
>>
>> Now that the logo issue finally has
On Wednesday 01 April 2009 6:44:35 am Patai Gergely wrote:
> Does ZipList have any useful monad instance? The thought came up while
> thinking about higher order dataflows and an ArrowApply interface for
> Yampa. As a ZipList can be thought of as a function with a discrete
> domain, I figured its m
2009/4/1 Luke Palmer :
> 2009/4/1 Patai Gergely
>>
>> Does ZipList have any useful monad instance? The thought came up while
>> thinking about higher order dataflows and an ArrowApply interface for
>> Yampa. As a ZipList can be thought of as a function with a discrete
>> domain, I figured its mona
Call for Talks and Tutorials
ACM SIGPLAN 2009 Developer Tracks on Functional Programming
http://www.defun2009.info/
Edinburgh, Scotland, September 3 and 5, 2009
The workshop will be held in conjunction with ICFP 2009
Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell library
for interactive rendering and display of values on the GHC heap using
Matt Morrow's vacuum library.
Awesome stuff, kudos to you and Matt Morrow!
I thought it'd be fun to visualize data structures in thre
Dear Haskellers,
so much has happened in the Haskell world in the past months.
Therefore, I would very much like to collect contributions for
the 16th edition of the
Haskell Communities & Activities Report
my quest for data structures continues. Lately I came across "Zippers".
Can anybody point be to some useful examples?
Once upon a time, there was a hardware implementation of a lambda
calculus based functional language (mostly, I was told, to show that it
could be done:-). The program representa
2009/4/1 Patai Gergely
> Does ZipList have any useful monad instance? The thought came up while
> thinking about higher order dataflows and an ArrowApply interface for
> Yampa. As a ZipList can be thought of as a function with a discrete
> domain, I figured its monadic form could be analogous to
There is now. Not much new in Orchid itself, but builds against the
updated Salvia. Because of the use of keep-alive the performance of
orchid should be a lot better now (at some places).
--
Sebastiaan
On Mar 28, 2009, at 10:26 PM, Paul L wrote:
Thanks for the massive update! Is there a new
But I am more interested in seeing the expansion and reduction that
the execution encounters as it lazily evaluates the function.
Have you tried GHood?
examples:
http://www.cs.kent.ac.uk/people/staff/cr3/toolbox/haskell/GHood/
package:
http://hackage.haskell.org/cgi-bin/hackage-scripts/
Does ZipList have any useful monad instance? The thought came up while
thinking about higher order dataflows and an ArrowApply interface for
Yampa. As a ZipList can be thought of as a function with a discrete
domain, I figured its monadic form could be analogous to the reader
monad, hence:
instanc
Antoine Latter wrote:
On Mon, Mar 9, 2009 at 7:14 PM, Windoze wrote:
Greetings,
am considering learning how to do a build for my slackware-based distro.
The doc sited below say's it requires:
glibc-devel
libedit-devel
ncurses-devel
gmp-devel
.etc.
Must I used the dev versions, or will it wo
wren ng thornton ha scritto:
Manlio Perillo wrote:
Since ratings for each customers are parsed "at the same time", using
a plain list would consume a lot of memory, since stream fusion can
only be executed at the end of the parsing.
On the other hand, when I want to group ratings by movies, s
I am wondering about how to give a correctness prove of a simple
parsing
algorithm. I tried to think of a simple example but even in this
case I
don't know how.
I'm not sure I understand your question, but I'm guessing you're
looking for general techniques for the formal verification of
On Wed, Apr 1, 2009 at 8:46 AM, Alistair Bayley wrote:
> ghci has a custom linker which behaves differently from gnu ld, which
> is what ghc uses. I don't recall the exact details (if I ever knew
> them), just that it differs. So something that works with ghc won't
> necessarily do so with ghci.
Yes, that's it. So I better more all the tutorials and demos into an
Examples folder.
Thanks Duncan, that should fix it, I'll test it tonight.
On Wed, Apr 1, 2009 at 11:12 AM, Duncan Coutts
wrote:
> On Wed, 2009-04-01 at 00:32 +0200, Peter Verswyvelen wrote:
> > I'm busy writing my first library
On Apr 1, 2009, at 4:02 AM, Brandon S. Allbery KF8NH wrote:
Yes, if the libsvg-cairo library is found when you run configure for
gtk2hs, it will be built.
The version of libsvg-cairo that I have installed from MacPorts does
not seem to work together with the native GTK+ framework for Macs.
That's not you usual Koala face.
Must be a special Simon^H^H^H^H^HHaskell-Koala species.
<>
On 1 Apr 2009, at 10:07, Simon Peyton-Jones wrote:
Dear Haskell enthusiasts,
Now that the logo issue finally has been settled, it is time to select
the proper Haskell mascot. As you are no doubt awar
On Wed, 2009-04-01 at 00:32 +0200, Peter Verswyvelen wrote:
> I'm busy writing my first library for Hackage - a wrapper for
> QuesoGLC, yet another OpenGL font renderer using Freetype2. So if
> someone else is already doing this, stop doing so :-)
>
>
> I've succesfully build the libquesoglc.a li
Daryoush Mehrtash wrote:
> But I am more interested in seeing the expansion and reduction that
> the execution encounters as it lazily evaluates the function.
Have you tried GHood?
http://www.cs.kent.ac.uk/people/staff/cr3/toolbox/haskell/GHood/
It is a bit like the recently-released Vacuu
wren ng thornton wrote:
> > how, for instance, turn a nested Map like
> >
> > Map Int (Map Int (Map String Double)
> >
> > into a "zipped" version.
> You can't. Or rather, you can't unless you have access to the
> implementation of the datastructure itself; and Data.Map doesn't provide
> enough de
59 matches
Mail list logo
