Dear all,
I have released hledger 0.4 on hackage. There is also a new website at http://hledger.org
, with screenshots (textual!), a demo (will it survive!?), and docs
(not too many!) Release notes are at http://hledger.org/NEWS , and
bravely pasted below.
In case you forgot: hledger is a
> ../haskell/prepose.lhs:707:0: Parse error in pattern
> which is pointing at:
> normalize a :: M s a = M (mod a (modulus (undefined :: s)))
The code indeed used lexically scoped type variables -- which GHC at
that time implemented differently. Incidentally, on the above line,
M s a is the type a
Hi,
I am interested in participating in this year's Google Summer of Code.
One of my proposals is going to be to write and extend existing
Haskell wrappers and API's for web services.
Some of the popular web services that I use are Google Maps, Flickr,
digg, reddit, Facebook and twitter, Quick go
On Fri, Apr 3, 2009 at 7:07 AM, Duane Johnson wrote:
> I hadn't seen that feature in Excel before. When I press F9 it seems to
> evaluate the expression, which isn't quite what I had in mind (Mac OS). Is
> that the same as what you get?
> Duane
>
Yeah, it's the same feature. It's just that in E
On 2009 Apr 3, at 0:00, Michael Snoyman wrote:
It's been multiple times now that I've been confounded by something
in Haskell which was then solved by a language extension (first
FunctionalDependencies, most recently ScopedTypeVariables). I'm
wondering if there is a list anywhere of all the
2009/4/2 :
> On Thu, Apr 02, 2009 at 07:55:07PM -0400, Rick R wrote:
>> You could profile your app for memory usage. Then you could figure out just
>> what function is blowing up the mem usage and figure out how to optimize it.
>>
>>
>> http://book.realworldhaskell.org/read/profiling-and-optimizat
Hi Cafe,
A quick question:
Is there a way to load a C object file associated with FFI imports into ghci
after invocation (or in a .ghci file)? I've checked the docs as carefully
as I can and can't find anything.
Naming the file on the command line works of course but I was hoping for
somethi
I also suspect that manyTill is a really bad choice, since it doesn't
give you anything until the end token. It would be much better if you
could rewrite your parser in terms of many and many1.
--Sterl
On Apr 2, 2009, at 10:08 PM, Luke Palmer wrote:
2009/4/2
I'm relatively new to haskell
I hadn't seen that feature in Excel before. When I press F9 it seems
to evaluate the expression, which isn't quite what I had in mind (Mac
OS). Is that the same as what you get?
Duane
On Apr 2, 2009, at 8:33 PM, Michael Snoyman wrote:
2009/4/3 Duane Johnson
Perhaps it wouldn't be as a
It's been multiple times now that I've been confounded by something in
Haskell which was then solved by a language extension (first
FunctionalDependencies, most recently ScopedTypeVariables). I'm wondering if
there is a list anywhere of all the language extensions supported by GHC and
a brief descr
On Thu, Apr 2, 2009 at 9:33 PM, Michael Snoyman wrote:
>
>
> 2009/4/3 Duane Johnson
>
>> Perhaps it wouldn't be as all-wonderful as I think, but as a "new" Haskell
>> user, I am constantly switching back and forth between various definitions
>> of things trying to compare documentation and files
2009/4/3 Duane Johnson
> Perhaps it wouldn't be as all-wonderful as I think, but as a "new" Haskell
> user, I am constantly switching back and forth between various definitions
> of things trying to compare documentation and files...
> The purpose of "expansion" as I was explaining it is not to *
I'm pleased to announce the initial release of the Haskell fad
library, developed by Barak A. Pearlmutter and Jeffrey Mark Siskind.
Fad provides Forward Automatic Differentiation (AD) for functions
polymorphic over instances of 'Num'. There have been many Haskell
implementations of forward AD, with
On 2009 Apr 2, at 19:13, Lyle Kopnicky wrote:
Since the time package is not included in ghc-6.10.2, I installed it
via cabal. Then I tried to configure my project, and it says that
the dependency is missing. Mysterious. Can anyone explain?
You installed time in the per-user package dictiona
2009/4/2
> I'm relatively new to haskell so as one does, I am rewriting an
> existing program in haskell to help learn the language.
>
> However, it eats up all my RAM whenever I run the program.
>
> http://hpaste.org/fastcgi/hpaste.fcgi/view?id=3175#a3175
>
> Obviously I'm doing something wrong,
On Thu, Apr 02, 2009 at 07:55:07PM -0400, Rick R wrote:
> You could profile your app for memory usage. Then you could figure out just
> what function is blowing up the mem usage and figure out how to optimize it.
>
>
> http://book.realworldhaskell.org/read/profiling-and-optimization.html
>
>
>
Simon Michael writes:
> I'm learning useful things in this thread.
>
> Ketil Malde wrote:
>> I've done this once, but with the cabal dependencies, not darcs. Thus
>> the uploaded sdist was missing one of the source files, and
>> consequently failed to build.
>
> I have a pre-release make target
Ketil Malde writes:
> Peter Verswyvelen writes:
>
>> Forgetting to add a file can be a nasty one, since if you discover
>> that too late, the original file at patch time might not exist
>> anymore (how do you guys solve this? Just plain discipline I
>> guess?).
>
> I've done this once, but with
Nicolas Pouillard writes:
> Excerpts from Peter Verswyvelen's message of Wed Apr 01 23:39:15 +0200 2009:
> [...]
>
>> biggest problems I usually see in teams - namely forgetting to add files,
>> forgetting to check in dependencies and the inability the merge after
>> renames or moves -
>
> Have a
Louis Wasserman:
Mkay. I get it now. I was under the impression that, essentially,
a data family was precisely equivalent to a type family aliasing to
a separately declared datatype.
No, they are not equivalent. You can see that as follows. Assume,
data family T a
type family S a
N
Perhaps it wouldn't be as all-wonderful as I think, but as a "new"
Haskell user, I am constantly switching back and forth between various
definitions of things trying to compare documentation and files...
The purpose of "expansion" as I was explaining it is not to
*permanently replace* what
It seems like a neat feature, and it could just be my inexperience with
Haskell but it doesn't seem "killer". For example, why would you want to
expand readLine like that if you already have it defined? It seems to
defeat much of the benefit of functional languages in the first place, which
is th
On Thu, 2009-04-02 at 18:01 -0600, Duane Johnson wrote:
> So I was thinking about a "killer feature" for a text editor.
> Wouldn't it be neat if you could expand function calls into their
> definitions, in-place?
>
> For example, suppose we have "minus" defined like so, somewhere in
> anoth
So I was thinking about a "killer feature" for a text editor.
Wouldn't it be neat if you could expand function calls into their
definitions, in-place?
For example, suppose we have "minus" defined like so, somewhere in
another file:
minus (a, b, c) (x, y, z) = (a - x, b - y, c - z)
Lat
You could profile your app for memory usage. Then you could figure out just
what function is blowing up the mem usage and figure out how to optimize it.
http://book.realworldhaskell.org/read/profiling-and-optimization.html
2009/4/2
> I'm relatively new to haskell so as one does, I am rewritin
On Thu, 2009-04-02 at 16:13 -0700, Lyle Kopnicky wrote:
> Hi folks,
>
> Since the time package is not included in ghc-6.10.2, I installed it
> via cabal. Then I tried to configure my project, and it says that the
> dependency is missing. Mysterious. Can anyone explain?
>
> l...@lwk-desktop:~/deve
Claus Reinke wrote:
> {-# LANGUAGE ScopedTypeVariables #-}
>
> without, the 'f's in the instance are independent.
> Claus
Thanks - I discovered this (by trial-and-error) at about the same time
you sent the email.
Is there a ticket somewhere to add a warning about this? I expected me
'f's to be t
2009/4/3 Vasili I. Galchin :
> Hello,
>
> Is there any project to retarget the GHC code generator to generate
> Common Intermediate Language(CLI) in order to run on Mono or .NET? I assume
> that Mondrian did precisely that.
There are/were a couple of projects attempting that or to bring
Hask
Mkay. I get it now. I was under the impression that, essentially, a data
family was precisely equivalent to a type family aliasing to a separately
declared datatype.
One more question: is there any way to get the low overhead of newtypes for
particular instances of a data family? Is this imposs
Hi folks,
Since the time package is not included in ghc-6.10.2, I installed it via
cabal. Then I tried to configure my project, and it says that the dependency
is missing. Mysterious. Can anyone explain?
l...@lwk-desktop:~/devel/vintage-basic$ ghc-pkg list
/usr/local/lib/ghc-6.10.2/./package.conf
I'm relatively new to haskell so as one does, I am rewriting an
existing program in haskell to help learn the language.
However, it eats up all my RAM whenever I run the program.
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=3175#a3175
Obviously I'm doing something wrong, but without my magical
David, guys,
sorry, this all started with a misconception on my behalf of what a
Zipper is and what it is good for.
In the days that followed my post this became much clearer though and I
now realize my original question was pointless.
It seems you spotted that and yes, "generalized trie" i
{-# LANGUAGE ScopedTypeVariables #-}
without, the 'f's in the instance are independent.
Claus
- Original Message -
From: "Jacques Carette"
To:
Sent: Thursday, April 02, 2009 10:15 PM
Subject: [Haskell-cafe] Issue with IsFunction/Vspace in GHC 6.10.1
I was playing with some of Oleg'
I was playing with some of Oleg's code (at end for convenience). After
minor adjustments for ghc 6.10.1, it still didn't work. The error
message is quite puzzling too, as it suggests adding exactly the
constraint which is present... Any ideas?
Jacques
-- Oleg's definition of a vector space
Hello again.
I finally got it myself. It was just a matter of parentheses:
See http://hpaste.org/fastcgi/hpaste.fcgi/view?id=3229 for the corrected
version.
Looks like what I was trying to do is not expressable via just an arrow, one
needs a function mapping the input arrow to a new one.
I'm g
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
does anyone have a .editrc they can provide that allows ghci to be used
on freebsd?
i'm not looking for anything fancy, just backspace not being broken etc
thanks
brad
-BEGIN PGP SIGNATURE-
Version: GnuPG v2.0.10 (Darwin)
iEYEARECAAYFAknVGd
Very nice.
Gleb Alexeyev wrote:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/vacuum-ubigraph
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Apr 02, 2009 at 09:54:16PM +0300, Michael Snoyman wrote:
> Interesting alternative. However, I think the ScopedTypeVariables looks a
> little bit cleaner. I'll keep the asTypeOf in mind for the future though.
That is a matter of taste. However 'asTypeOf' has a clear
advantage: it is Haske
Ah, I did not know this asTypeOf function.
But ScopedTypeVariables also allows you to give inner functions type
signatures that reuse polymorphic type parameters of the parent scope, which
makes code clearer I think.
On Thu, Apr 2, 2009 at 8:54 PM, Michael Snoyman wrote:
>
>
> On Thu, Apr 2, 200
On Thu, Apr 2, 2009 at 9:51 PM, Felipe Lessa wrote:
> On Thu, Apr 02, 2009 at 08:18:27PM +0200, Peter Verswyvelen wrote:
> > The type inferer seems to struggle to find the type of minBound and
> > maxBound, and GHC asks to use a type annotation.
> > To only way I see how to add a type annotation
On Thu, Apr 02, 2009 at 08:18:27PM +0200, Peter Verswyvelen wrote:
> The type inferer seems to struggle to find the type of minBound and
> maxBound, and GHC asks to use a type annotation.
> To only way I see how to add a type annotation here is to use a GHC
> extension:
>
> {-# LANGUAGE ScopedTypeV
Peter and Lennart,
Scoped type variables is exactly what I needed to know. Thanks for solving
this annoyance for me!
Michael
On Thu, Apr 2, 2009 at 9:18 PM, Peter Verswyvelen wrote:
> The type inferer seems to struggle to find the type of minBound and
> maxBound, and GHC asks to use a type ann
There's nothing connecting the Enum/Bounded used in fromEnum and min/
maxBound to the toEnum, as there's an Int in the middle. Annotated
very explicitly, the type inferrer probably sees something like:
randomEnum :: (Enum a, Bounded a, RandomGen g) => Rand g a
randomEnum = do
let minb = (
The type inferer seems to struggle to find the type of minBound and
maxBound, and GHC asks to use a type annotation.
To only way I see how to add a type annotation here is to use a GHC
extension:
{-# LANGUAGE ScopedTypeVariables #-}
randomEnum :: forall a g. (Enum a, Bounded a, RandomGen g) => Ra
I've butted into this problem multiple times, so I thought it's finally time
to get a good solution. I don't even have the terminology to describe the
issue, so I'll just post the code I'm annoyed with and hope someone
understands what I mean.
import Control.Monad.Random
import System.Random
data
2009/4/2 Louis Wasserman :
> Mkay. One more quick thing -- the wiki demonstrates a place where the
> original attempt worked, with a data family instead. (That is, replacing
> 'type' with 'data' and adjusting the instance makes this program compile
> immediately.)
> a) Is there a type-hackery reas
I'm learning useful things in this thread.
Ketil Malde wrote:
> I've done this once, but with the cabal dependencies, not darcs. Thus
> the uploaded sdist was missing one of the source files, and
> consequently failed to build.
I have a pre-release make target where I test everything I can thin
Iavor Diatchki wrote:
Hi,
The linking problem might be due to a bug in the cabal file: if you
have modules that are not exposed, you still need to list them in the
"other-modules" section.
This was the problem, thanks!
___
Haskell-Cafe mailing lis
Hello,
Is there any project to retarget the GHC code generator to generate
Common Intermediate Language(CLI) in order to run on Mono or .NET? I assume
that Mondrian did precisely that.
Thanks, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@hask
Hi,
The linking problem might be due to a bug in the cabal file: if you
have modules that are not exposed, you still need to list them in the
"other-modules" section.
-Iavor
On Thu, Apr 2, 2009 at 10:01 AM, Gleb Alexeyev wrote:
> Don Stewart wrote:
>>
>> Please upload!!
>>
>
> I've run into 2 pr
Don Stewart wrote:
Please upload!!
I've run into 2 problems while trying to do this.
The first one - haxr won't build with HTTP-4000, so I had to edit
haxr.cabal and add the upper version bound for HTTP.
The second one is puzzling me.
I've cabal-installed the package, but keep getting link
On Thu, Apr 02, 2009 at 11:53:00AM -0400, Jeff Heard wrote:
> and so forth to be compatible with Bus [EData a], but I think that in
> the end so many widgets will reuse the EData type that it's just as
> well to make it part of the Event rather than force the user to be
> explicit about it every ti
2009/4/2 Henry Laxen :
> Dear Group,
>
> I'm trying to read the paper:
> "Functional Pearl: Implicit Configurations"
> at http://www.cs.rutgers.edu/~ccshan/prepose/
> and when running the code in prepose.lhs I get:
> ../haskell/prepose.lhs:707:0: Parse error in pattern
> which is pointing at:
> nor
Alright, updated it to extract EData from the Event type and make it
separate. Basically, now all type signatures
Event a
Widget a
Behaviour a
should read
Event [EData a]
Widget [EData a]
Behaviour [EData a]
for backward compatibility.
On Thu, Apr 2, 2009 at 11:53 AM, Jeff Heard wrote:
> On
Mkay. One more quick thing -- the wiki demonstrates a place where the
original attempt worked, with a data family instead. (That is, replacing
'type' with 'data' and adjusting the instance makes this program compile
immediately.)
a) Is there a type-hackery reason this is different from data famili
2009/4/2 Louis Wasserman
> The following module does not compile, and I can't figure out why:
> {-# LANGUAGE TypeFamilies #-}
> {-# LANGUAGE KindSignatures #-}
>
> module Foo where
>
> import Control.Monad
> import Data.Maybe
>
> class Key k where
> type Map k :: * -> *
> empty :: Map k v
> look
The following module does not compile, and I can't figure out why:
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE KindSignatures #-}
module Foo where
import Control.Monad
import Data.Maybe
class Key k where
type Map k :: * -> *
empty :: Map k v
look :: k -> Map k v -> Maybe v
update :: k -> (Maybe
Dear Group,
I'm trying to read the paper:
"Functional Pearl: Implicit Configurations"
at http://www.cs.rutgers.edu/~ccshan/prepose/
and when running the code in prepose.lhs I get:
../haskell/prepose.lhs:707:0: Parse error in pattern
which is pointing at:
normalize a :: M s a = M (mod a (modulus (u
On Thu, Apr 2, 2009 at 11:22 AM, Jules Bean wrote:
>
> Maybe I wasn't clear, and probably I'm being dense. I understand what you've
> done - I looked at the type declarations before commenting - but I don't
> understand why.
>
> Why is it useful to be able to use basic types without locking down '
Daryoush Mehrtash wrote:
When I try to install the hubigraph I get the following error:
skip
Network/XmlRpc/Client.hs:113:23:
Not in scope: type constructor or class `ConnError'
Network/XmlRpc/Client.hs:113:51:
Not in scope: type constructor or class `ConnError'
cabal: Error: some p
Jeff Heard wrote:
A last but somewhat minor thing is that the Event type is fairly
general, allowing for multiple data to be attached to a single event
and this data to be of many of the standard types (Int, String,
Double, ByteString, etc) as well as a user-defined type. Of course,
such an even
Jeff Heard wrote:
It is parametrically polymorphic in a. And no, it's an arbitrary
decision, BUT... it allows me and other users to define generally
useful behaviours and widgets to package with the library using the
basic types without locking down 'a'. The EventData type looks like
this:
da
It is parametrically polymorphic in a. And no, it's an arbitrary
decision, BUT... it allows me and other users to define generally
useful behaviours and widgets to package with the library using the
basic types without locking down 'a'. The EventData type looks like
this:
data Event a { ..., ed
It seems to be a trend to use more and more IO in new FRP approaches.
Grapefruit's circuits encapsulate side effects, as does your approach
This is a big departure from the "pure" libs like Fran, Yampa, Reactive, ...
I wander if this is because of some fundamental problem with functional
programm
Funny ... I never write an url in a mail : I type it in firefox (so I
actually check it) then copy/paste it.
2009/4/2 Jeff Heard :
> Check links... god. http://vis.renci.org/jeff/buster (can you tell
> I was up till 3am last night?)
>
> On Thu, Apr 2, 2009 at 10:05 AM, Jeff Heard
> wrote:
>>
Check links... god. http://vis.renci.org/jeff/buster (can you tell
I was up till 3am last night?)
On Thu, Apr 2, 2009 at 10:05 AM, Jeff Heard wrote:
> Yes,sorry. vis, not vs. http://vis.renci.org/buster
>
> It is a bit like grapefruit's circuits, but where Grapefruit circuits
> describe the f
Yes,sorry. vis, not vs. http://vis.renci.org/buster
It is a bit like grapefruit's circuits, but where Grapefruit circuits
describe the flow of events from place to place, Buster never does.
Events exist for all behaviours, to be selected by name, group, or
source. The other major difference is t
It's vis instead of vs:
http://vis.renci.org/jeff/buster/
2009/4/2 Peter Verswyvelen :
> Sounds vaguely like Grapefruit's circuits, but I could be very wrong...
> The link you provided seems to be broken?
> On Thu, Apr 2, 2009 at 3:05 PM, Jeff Heard
> wrote:
>>
>> Read more about it on its webpag
Sounds vaguely like Grapefruit's circuits, but I could be very wrong...
The link you provided seems to be broken?
On Thu, Apr 2, 2009 at 3:05 PM, Jeff Heard wrote:
> Read more about it on its webpage: http://vs.renci.org/jeff/buster
>
> Yes, it’s to solve a particular problem. And yes, this is a
Judah Jacobson wrote:
Not sure if it will help, but you could take a look at what I did in Haskeline:
http://code.haskell.org/haskeline/System/Console/Haskeline/Backend/Win32.hsc
It would be nice to get some of that into the main win32 package...
Cheers,
Simon
___
Hi.
I've got a problem with the Haskell XML Toolkit (hxt). I want to write a little
app that performs REST requests from a certain (rather simple) XML format.
A example procedure Call looks like testData defined below.
What I'd like to do is to transform this xml tree into a GET variable string
Read more about it on its webpage: http://vs.renci.org/jeff/buster
Yes, it’s to solve a particular problem. And yes, this is a rough
draft of an explanation of how it works. I’ve not even really
solidified the vocabulary yet, but I have this module which couches a
large, abstract, interactive (b
Hi Simon,
you quite nicely describe what leksah is doing already. Try to find find the
source code for all installed packages by locating cabal files, parse the
module sources via the Ghc API (actually not so much the API), using info
from cabal files for this (which is a dark art). It extracts co
Has anyone ported the SciMark2 benchmark suite to Haskell?
--
Dr Jon Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/?e
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Waern wrote:
2009/4/2 Duncan Coutts :
On Wed, 2009-04-01 at 22:13 +0200, David Waern wrote:
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 v
> For instance, if we consider just join, with the above definition:
>
> join [[1,2],[3]] = [1, _|_]
>
> Which, I think, is fairly undesirable. You can try to avoid bottoms like
> so:
Well, there is a trick you can use here: wrap everything in a Maybe. Not
that it helps with the efficiency issu
> Yes, although you should use an actual infinite list type if you're
> depending on that.
I know, I just wanted to stick with the basic list type for the sake of
the discussion.
> In fact, the Stream package provides an infinite list type with
> Applicative and Monad instances.
I didn't know that
> Having spent several months on this exact problem, I'll say that I
> consider it pretty unlikely.
I wouldn't be very surprised if that was the case.
> A clever data structure might give you logarithmic or even amortized
> constant time access in sequential cases, but you probably will not have
>
2009/4/2 Duncan Coutts :
> On Wed, 2009-04-01 at 22:13 +0200, David Waern wrote:
>> 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
Peter Verswyvelen writes:
> Forgetting to add a file can be a nasty one, since if you discover
> that too late, the original file at patch time might not exist
> anymore (how do you guys solve this? Just plain discipline I
> guess?).
I've done this once, but with the cabal dependencies, not darc
On Wed, 2009-04-01 at 22:13 +0200, David Waern wrote:
> 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
Hi.
I'm having memory problems decoding a big IntMap.
The data structure is:
IntMap (UArr (Word16 :*: Word8))
There are 480189 keys, and a total of 100480507 elements
(Netflix Prize).
The size of the encoded (and compressed) data is 184 MB.
When I load data from the Netflix Prize data set, t
When I try to install the hubigraph I get the following error:
:~/Desktop/hubigraph-0.1$ cabal install
Resolving dependencies...
'haxr-3000.1.1.2' is cached.
Configuring haxr-3000.1.1.2...
Preprocessing library haxr-3000.1.1.2...
Building haxr-3000.1.1.2...
[1 of 6] Compiling Network.XmlRpc.DTD_X
Excerpts from Peter Verswyvelen's message of Wed Apr 01 23:39:15 +0200 2009:
[...]
> biggest problems I usually see in teams - namely forgetting to add files,
> forgetting to check in dependencies and the inability the merge after
> renames or moves -
Have a look at the --look-for-adds flag that
Thanks very much for the help... I will look at this over the next couple of
days. Your code actually addresses a different problem, the one of merging
separates lists of timed events. I do need to write code to do that eventually,
so I will try to understand what you have written here. However,
2009/4/2 minh thu
> 2009/4/2 Csaba Hruska :
> > 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
> >
Don Stewart wrote:
Did you use hubigraph?
http://ooxo.org/hubigraph/
This cabalized project doesn't appear to be on hackage!
Oh, I wasn't aware of hubigraph until now.
Ubigraph has very simple XML-RPC-based API so I used it directly.
Hubigraph, of course, looks nicer with its custom mona
2009/4/2 Csaba Hruska :
> 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 hand
88 matches
Mail list logo
