I noticed many code snippets on the wiki that have syntax colouring.
How is this done? Can I convert syntax coloured code from Emacs to HTML?
I'm using the Haskell mode for Emacs to get the syntax colouring.
I'm writing a monads for C# programmers tutorial (oh no) and would
I wanted to do some experiments with HOpenGL, and one of the things I tried is
importing 3D models.
So I searched for a library that could do that, but besides Frag, who uses the
limited MD3 format, I did not find anything useful. Has any work been done on
supporting that? Maybe just
When reading an article about tail recursion
(http://themechanicalbride.blogspot.com/2007/04/haskell-for-c-3-programmers.
html) I came across the follow statements:
If you can write a non-recursive function that uses the colon syntax it is
probably better than a tail recursive one that doesn't.
Thanks. I got confused because the StackOverflow link on
http://www.haskell.org/haskellwiki/HaWiki_migration
is dead.
-Original Message-
From: Derek Elkins [mailto:[EMAIL PROTECTED]
Sent: Saturday, August 18, 2007 8:54 PM
To: Peter Verswyvelen
Cc: haskell-cafe@haskell.org
Subject: Re
x1 y1) (d x2 y2) = d (f x1 x2) (f y1 y2)
But this does not work, as the pattern matcher does not seem to like this.
Thanks,
Peter Verswyvelen
PS: Of course I could define a single type like:
data Pair a = P a a
type Vector = Pair Float
type Matrix = Pair Vector
Haskell, it feels like a bad idea to
reintroduce them locally in my code...
Thanks (again!)
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yes indeed, I realized that. I oversimplified my question. I'm basically
trying to model 4D CG/HLSL operations (pixel/vertex shaders) in Haskell.
I tried realToFrac, but that did not work. Then I tried splitting the
instances into Fractional and Integral, but I kept getting errors. Maybe
because
I think DrScheme does that for Scheme. So a must have for Haskell! Maybe could
be added to the Helium project?
- Oorspronkelijk bericht -
Van: apfelmus [mailto:[EMAIL PROTECTED]
Verzonden: donderdag, augustus 23, 2007 08:00 PM
Aan: haskell-cafe@haskell.org
Onderwerp: [Haskell-cafe] Re:
First of all, I'm really excited that GTK2HS 0.9.12 now allows launching SOE
apps using GHCI.
However, in the code below the blue and green triangle should render on top of
each other, but the green triangle is rendered incorrectly.
Being a newbie, I hesitate to file a bug report... Can anyone
I'm trying to make a package of Ben.Lippmeier's very nice ANUPlot graphics
library (http://cs.anu.edu.au/people/Ben.Lippmeier)
IMHO this would be a great contribution to the Haskell library, it's very
clean code for newbies :)
I created the following cabal file:
name: Plot
version: 1.1
license:
: Re: [Haskell-cafe] How to fix linker errors when creating a package
using cabal
Peter Verswyvelen:
However, when building an example that uses that package, I get a lot of
linker errors (see log below)
What options did you use when compiling the example
Indeed, adding the non-exposed modules to the other-modules fixed it.
Thanks Allan!
Cheers,
Peter
-Original Message-
From: Allan Clark [mailto:[EMAIL PROTECTED]
Sent: Saturday, August 25, 2007 2:28 PM
To: Peter Verswyvelen
Subject: Re: [Haskell-cafe] How to fix linker errors when
- A graphical programming tool. (You add boxes and put in lines, it
constructs a program that you can run.)
You mean a programming tool with a horrible syntax and user interface?
If you want to remove the joy from programming, just use Ada.
For programmers or scientists, I agree.
For
heared Haskell is really hard
to debug.
Anyway, although my IQ is far below 160, I find Haskell the most exciting
language I have ever learned (and I've only scratched the bare surface of
the language)
Cheers,
Peter Verswyvelen
___
Haskell-Cafe
Game developers are really struggling to get performance out of the
Playstation 3 console. This console has a single PowerPC CPU with 6 Cell SPU
coprocessors, all running at 3.3GHz. These SPUs have 256KB very high speed
local RAM, and data from the 512MB main memory can stream in and out via DMA
A while ago I confused currying with partial application, which was
pointed out by members of this community, and the wiki pages got adapted
so that newbies like me don't make the same mistake twice ;) That's great.
Anyway, at the risk of making mistakes again, I'm looking for good
In Scheme, on can quote code, so that it becomes data. Microsoft's F#
and C# 3.0 also have something similar that turns code into expression
trees. The latter is used extensively in LINQ which translates plain C#
code into SQL code or any other code at runtime (this idea came from FP
I heared)
Look at Template Haskell.
Intuitively Template Haskell provides new language features that
allow us to convert back and forth between concrete syntax, i.e. what
Gee coming from C++ that was the last thing I expected templates to do. It
seems a bit more powerful in Haskell though!
I'll look
The author of the question (Tony Morris) actually asked two different
questions, and so people gave two different replies :)
To quote Tony:
"I may have misunderstood his problem (we were drawing in dirt) and actually, it is
the straight line between the two points on the circumference that
I want to make an array using GLUT.Key as an index, but it is not an
instance of Enum nor Ix
Of course, I can make it an instance myself, but I guess it would be
easier to do so in the library?
Cheers,
Peter
___
Haskell-Cafe mailing list
F# and Concurrent Clean introduced special syntax for doing this. Basically
they just invent new names for you.
In Haskell (warning: I'm a newbie, so take this with a grain of salt), I
guess you just use monads if you want to pass a value from one function to
another under some context, or you
Although I'm sure a lot can be done on modern GPU's (especially the DirectX
10 cards = Nvidia 8x00, that can write back to main memory, called geometry
shaders), a Playstation 3 runs Linux, doesn't cost a lot, and it has 7 CPUs
running at 3+ GHz, and 6 of these have parallel vector processing
Peter Verswyvelen wrote:
Thanks, this is very useful information!
Prolog is indeed on my list as languages I want to learn. I understand
the basic principles, but haven't digged deep yet. But first I want to
do Haskell, which I'm now totally addicted to!
But after reading http
I like the fact that Haskel treats numbers in a generic way, so you can
lift them to any other datatype by instantiating Num.
Can the same be done on other builtin constructs? For example, if I have
[a], can this list be lifted to other types? I guess not, because no
type class exists for the
Chaddaï Fouché wrote:
You can indeed already do that, except it won't be a single instance
since list have a bucketful of interesting properties. A good starting
is looking at what list is an instance of and trying to identify the
set of instance which interest us in this case, Foldable and
Sven Panne wrote:
... and even more easily hypothesize why this is not always a good indication:
High-qualitiy standard libraries which are packaged with GHC/Hugs/... will
probably almost never be downloaded separately.
Solution: change GHC/Hugs so it submits usage counters of which
Sven Panne wrote:
... and even more easily hypothesize why this is not always a good
indication:
High-qualitiy standard libraries which are packaged with GHC/Hugs/...
will probably almost never be downloaded separately.
Solution: change GHC/Hugs so it submits (via a webservice, stored in a
Snif, this is sad... :-( Oh well, maybe this gets improved in Haskell
Prime ;-)
Lennart Augustsson wrote:
You're right. The list syntax is only for lists in Haskell. It would
be nice if the list syntax was overloaded too.
You can overload numeric literals (by defining fromInteger) and
Jerzy Karczmarczuk wrote
Perhaps somebody can say more about constraint languages which replaced
Yes please! Of example, how correct is
http://en.wikipedia.org/wiki/Constraint_programming?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Off off off topic: The Z80 DID make it! It was used in many many game
consoles (the best selling Nintendo Gameboy!) and arcade machines,
mostly as a secondary sound synthesiser or IO controller. See
http://en.wikipedia.org/wiki/Zilog_Z80. Even when only counting the
Nintendo Gameboy, the CPU
Well, then you should take a look at Boo... http://boo.codehaus.org
I wrote half a million lines of C# code the last years, and I've looked
at many languages, and currently Haskell is the most beautiful one I
could find. But since I'm still a Haskell newbie, I can't really judge,
but it is my
Okay. Now the following might not make sense at all, but... isn't the
abstract concept of a list just a sequence of elements (okay, with a
whole lot of extra properties)? So couldn't we write: do { 1;2;3;4 }
instead of [1,2,3,4] somehow for some special list builder monad? And
then do
If I'm not mistaken, in set theory, a closure of R with respect to some
property P is the smallest superset R* that has the property P.
To me, intuitively, a closure C in programming languages is a function
that has bindings to variables declared in parent functions; so the
inner function can
Henning Thielemann wrote:
If you are happy with writing do {1;2;3;4} you are certainly also happy
with cv [1,2,3,4], where cv means 'convert' and is a method of a class
for converting between lists and another sequence type.
class ListCompatible lc where
cv :: [a] - lc a
rt :: lc a - [a]
Jonathan Cast wrote:
I don't think this has been mentioned explicitly yet, but the
discrepancy is purely for pedagogical purposes.
In Gofer, list comprehensions (and list syntax, IIRC) /was/ generalized
(to an arbitrary instance of MonadPlus). But that means that any
mistake in your syntax
frequent?). Now I'm sure Simon can do the AI part much
better than any computer ;-)
Cheers,
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Instead of just adapting the compiler to give better errors, it would
really help if a unique identifier was assigned to each error/warning,
and if a WIKI and help file existed that describes the errors in detail.
Maybe this is already the case, but after a quick search I failed to
find such a
I find it unfortunate that one can't (I guess) define custom unary
operators in Haskell.
Is this correct? If so, is this just because eg (* 100) declares a
function that partially applies the * operator, so this syntax disallows
unary operators? Could this be fixed by introducing a different
Why? What is your application? In fact, alphanumeric identifiers are
used as unary operators.
Why? Well, why are binary operators allowed and unary operators not?
Isn't that some kind of discrimination? In math, many many operators are
unary. Haskell allows creating binary operators. So I
Brandon S. Allbery KF8NH wrote:
On Sep 9, 2007, at 9:09 , Peter Verswyvelen wrote:
I think that the benefits of prefix or postfix symbolic operators
were not worth dispensing with the comfortable section syntax.
Well, that's personal I guess, but I would prefer the syntax (? /
100) and (100
Malcolm Wallace wrote:
Incidentally, the nhc98 compiler has always permitted the definition of
unary operators, as an extension to the language. (It was just more
convenient to create a general mechanism for unary/prefix operators,
than to code the special case for negative numbers.)
Cool! I
Henning Thielemann wrote:
The more syntactic constructs exist, the more complicated it becomes
to read such programs. Today, if you read a symbolic operator which is
not -, not a single dot with a capital identifier to the left
(qualification), not a double dot in a bracket (enumeration) and
Nice. Thanks for the info, but the symbolic notation is not the only
reason for using Haskell, it's also to force them into solving simple
problems without using mutable variables, so they see this alternative
functional programming approach BEFORE they are specialist in C++,
because then they
Winhugs seems to have some shortcut keys, like F5 for run.
It does not seem to have shortcut keys for reload, edit, etc...
These would be really handy. It is possible to customize the shortcuts
assigned to the commands?
If not, can it be build from source?
Thanks,
Peter
Hi Neil,
This is so silly, I just switched from Helium to WinHugs and did not
realize it performed automatic reloading. As Helium provides shortcut
keys for reload and edit, I just got confused. I should have RTFM!
Automatic reloading is of course THE best solution, and that's already
in
The Haskell mailing list seems to be filled with people requesting
information about this error, so I cannot resist to include myself in it ;-)
I've read the information about funcdeps in the GHC user guide, and I
think I understand how it works, but I get the error a lot, without
having a
Never mind, that GHC compiler was again more clever than me, sigh.
That's really frustrating about Haskell: the compiler captures so many
errors at compile time, that newbies hardly get anything done, it's a
constant battle against the errors. But once it compiles, it usually
works at runtime
except a much terser notation and simpler mutable array support. I'd
stick to Haskell.
Mike
Peter Verswyvelen wrote:
Nice. Thanks for the info, but the symbolic notation is not the only
reason for using Haskell, it's also to force them into solving simple
problems without using mutable
The way I see it as a newcomer, Haskell shifts the typical imperical
programming bugs like null pointers and buffer overruns towards
space/time leaks, causing programs that either take exponentially long
to complete, stack overflow, or fill up the swap file on disc because
they consume
Because I had a background in videogame development, I purchased The
Haskell School of Expression. I found this a great book, but it has a
fast pace, so be prepared.
To me, Haskell was a bit like climbing a mountain which is largely
covered by fog; you don't see anything until you've climbed high
Well, I actually meant more something like the imperative equivalences
of code coverage tools and unit testing tools, because I've read
rumors that in Haskell, unit testing is more difficult because lazy
evaluation will cause the units that got tested to be evaluated
completely different
That's a really weird statement, and one that goes completely opposite
to my view of things. Do you have sources for these rumours? In a pure
language, if you evaluate some code it will do exactly the same thing
every time - there is no different behaviour. If you test the code,
Sorry, I did
would say deep seq forces strict evaluation of the complete
graph of its first argument? Is this correct?
Peter
-Original Message-
From: Don Stewart [mailto:[EMAIL PROTECTED]
Sent: Tuesday, September 11, 2007 10:11 PM
To: Peter Verswyvelen
Cc: Neil Mitchell; Haskell-Cafe
Subject: Re
I showed Vital (http://www.cs.kent.ac.uk/projects/vital) to some
teachers at my university and they where really enthousiastic.
IMHO the Haskell community needs something like this, but for *real*
Haskell (preferable with extensions), and not using Java...
Is any work being done on something
This is all very cool stuff, but sometimes I wander if it isn't possible
to drop the special languages for fiddling with types, and introduce
just a single language which has no types, only raw data from which you
can built your own types (as in the old days when we used macro
assemblers ;-),
Adrian Neumann wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: RIPEMD160
I heard only rumors, but isn't Lisp supposed to be just that? A
programmable programming language?
Peter Verswyvelen schrieb:
This is all very cool stuff, but sometimes I wander if it isn't possible
to drop the special
Maybe this is a stupid question, but I don't find something similar in
Haskell.
I find mod and rem, which work on integers. But I'm looking for a
function similar to C's fmod.
Of course I can write it myself, but I guess it must already exist under
a different name?
Thanks,
Peter
.*
Thanks a lot. I wouldn't have found that myself ;-)
Jules Bean wrote:
Peter Verswyvelen wrote:
Maybe this is a stupid question, but I don't find something similar
in Haskell.
I find mod and rem, which work on integers. But I'm looking for a
function similar to C's fmod.
Of course I can write
I'm experimenting with functional reactive programming for creating
simple 2D/3D video games and interactive apps, trying to develop my own
version of it from scratch, for learning Haskell.
I got stuck with an endless loop when trying to split a stream into a
pair of two streams (a kind of
Mmm, yes of course... blush...
But shouldn't
f ~(x:xs) = rhs
give a compile-time error since neither x nor xs is used in the right
hand side, and hence nothing will ever get pattern matched when this
function is called, which clearly indicates a mistake? That is, if I
understand lazy
During a googling session, I can across (Win)HIPE, a visualization
program for the functional language HOPE. See
http://dalila.sip.ucm.es/~cpareja/winhipe
IMHO a similar tool would be a nice for learning/teaching Haskell; does
that exist, or something else that comes close?
Thanks,
Peter
Yes, Hat does this http://www.haskell.org/hat/ (if you can get it to
work, I typically have little success)
Thanks. WinHIPE uses graphics and animation. If briefly encountered Hat
before, but I had the impression it did not visualize the graphs using
graphics, only text. Is this correct?
C.M.Brown wrote:
f ~(x:xs) = x + 2
f ~[] = 42
Then f [] would give a complie error:
Irrefutable pattern failed for pattern (x : xs)
Sorry, that should be *runtime* error!
Chris.
It seems GHC does give a warning at compile-time about it, so you did
get it right the first time :-)
It's even more confusing that pattern matching in 'let' _is_ lazy.
Then why are patterns in lambdas not lazy?
I'm learning a lot here! :-)
Peter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Since I'm hopelessly stuck with an weird infinite loop (that consumes 0%
CPU time!), and since I can't find the problem using trace, I wanted
to try GHC 6.7, which seems to container a debugger (woohoo!!!).
Currently I'm using GHC-6.6.1 on Windows.
So I grabbed ghc-6.7.20070824 (=the latest
Thanks for the info, very interesting. Yes, I'm using GHCi, and I'm
using forkOS, and I'm using OpenGL...
Since I'm used to write heavily multi-threaded/multi-core code in
imperative languages, I would like to understand more about the existing
execution models, and those black holes...
All dependencies etc. have changed when going to 6.7/6.8 - you are
probably better off using 6.6.1 for now.
That's a petty. I really would like to experiment with the debugger :-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Oh yes, it's really confusing, this HOpenGL web-page is completely
obsolete :-) It confused me so much I stopped looking at Haskell initially.
Luckily this mailing list exists, and the other members of this group
already gave you adequate instructions how to get started :-)
Some other things
STG is a very pretty island, but it's just that - an island. If you
want to see the Big Picture, I can only recommend SPJ's 1987 (except for
the optimization section, almost everything is still true) book:
http://research.microsoft.com/~simonpj/papers/slpj-book-1987/slpj-book-1987.djvu
Tony Morris wrote:
is the same as:
(.) :: (b - c) - ((a - b) - (a - c))
..
accepts a function a to c and returns a function. The function returned
takes a function a to b and returns a function a to c
IMO, that should be
accepts a function b to c and returns a function. The function returned
time usage.
Cheers,
Peter Verswyvelen
Pasqualino 'Titto' Assini wrote:
Hi,
if I define:
f = f
and then try to evaluate 'f' in GHCi, as one would expect, the interpreter
never returns an answer.
The funny thing is that, while it is stuck in an infinite loop, GHCi doesn't
seem to use any
Peter Verswyvelen wrote:
http://www.haskell.org/ghc/docs/2.10/users_guide/user_146.html
http://www.haskell.org/ghc/docs/2.10/users_guide/user_146.htmlseems to
confirm that?
Oops, sorry, these seems to be docs for Concurrent Haskell... But maybe
the experts can confirm if the principle
the
pointer to the list is actually a pointer to the delayed computation (a
thunk?) of the tail, but the code doesn't seem to do that.
Thanks for any help, I hope I explained the problem well enough.
Peter Verswyvelen
___
Haskell-Cafe mailing
I'm not sure, but since it would require the detection of an evaluation
that does not terminate, it comes down to the halting problem, which is
not generally solvable. Maybe the experts can confirm my intuition?
Andrew Coppin wrote:
Peter Verswyvelen wrote:
http://www.haskell.org/ghc/docs
Neil Mitchell wrote:
I think your intuition is off. This isn't the problem of detecting
Oh well, that happens when I try to help people when I don't really know
what I'm talking about ;-)
I though it was impossible to detect a deadlock (and a blackhole is
something like a deadlock no?)
Thanks Paul Paul for the answers. I'll certainly read the paper Paul Liu
reported.
I just deleted 100 lines of text which explained my problem in more detail, and
while I was explaining it, I answered it myself. Typical. I thought the lambda
function that memo1 returns would be called over
-Original Message-
From: Paul Hudak [mailto:[EMAIL PROTECTED]
Sent: Tuesday, September 25, 2007 2:45 PM
To: Peter Verswyvelen
Cc: Haskell-Cafe; Paul Liu; [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Troubles understanding memoization in SOE
Peter Verswyvelen wrote:
I thought the lambda function
outputs. The input is
internally split using a Y. This does not seem consistent with the other
boxes (e.g. *first *or *loop *internally) that show two arrows for an
incoming/outgoing pair, so I would say the outer box of would also
have two inputs and two outputs.
Best regards,
Peter Verswyvelen
That looks nice, but HGL does not work on Windows anymore does it?
Thanks,
Peter
-Original Message-
From: Henning Thielemann [mailto:[EMAIL PROTECTED]
Sent: Wednesday, September 26, 2007 11:44 AM
To: Peter Verswyvelen
Cc: Haskell-Cafe
Subject: Re: [Haskell-cafe] Troubles understanding
that was the cause of my videogame
addiction :)
Cheers,
Peter
-Original Message-
From: Paul Hudak [mailto:[EMAIL PROTECTED]
Sent: Wednesday, September 26, 2007 2:39 PM
To: Peter Verswyvelen
Cc: Henning Thielemann; Haskell-Cafe; [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Troubles understanding
Super, really looking forward to GHC 6.8.1 then. Is it ready for primetime
on Windows?
Again, someone should really build an IDE around all these goodies, but yes,
that is a massive undertaking.
Cheers,
Peter
The debugger in 6.8.1 can also help to track down loops and deadlocks.
Set
I retrieved the latest version of YI, but I failed to compile it for Windows
(GHC 6.6.1, and I got alex-2.1.0, haddock-0.8, HsColour, GTK, but not VTY)
Before even pasting the error log, is it supported in Windows?
I see that make gave the error ghc.exe: unknown package: unix and some
Paul L wrote:
We recently wrote a paper about the leak problem. The draft is at
http://www.cs.yale.edu/~hl293/download/leak.pdf. Comments are welcome!
I'm trying to understand the following in this paper:
(A) repeat x = x : repeat x
or, in lambdas:
(B) repeat = λx → x : repeat x
This
This is of course very easy to do manually, but does a command line tool
exist for extracting source code from literate Haskell files?
Thanks,
Peter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi Immanuel,
Are you using Windows or Linux or OSX?
Under Windows, I was able to install it (no need to compile, since the
libraries are bundled).
I could also run some examples from the SOE book, however IMO the GLFW
Haskell wrapper seems to contain some bugs (at least on Windows) that
The latest version of SOE comes with a wrapper for a nice GLFW library. This
library comes with a demo of a 3D bouncing Amiga ball so it must be the
best library in the world ;-) ;-)
Since I'm letting my students play with WinHugs, I would prefer to have a
WinHugs compatible version of that
In the (Win)Hugs documentation, I found
Only the ccall, stdcall and *dotnet *calling conventions are supported.
All others are flagged as errors.
However, I fail to find any more information on how to invoke dotnet
methods. This might be really handy for me, as I'm very familiar with
the
The following code, when compiled with GHC 6.6.1 --make -O gives a stack
overflow when I enter 100 as a command line argument:
(please don't look at the efficiency of the code, it can of course be
improved a lot both in time performance and numeric precision...)
import System
leibnizPI
For me, a good reason why one should look at Haskell is because you
should NOT look at Haskell since it will change your view on programming
so much, you don't want to go back... ;-)
But where is the great IDE Haskell deserves??? :-) Seriously, 99% of the
programmers I know don't want to look
with mysum, it
just needed more iterations?
Many thanks,
Peter
Bertram Felgenhauer wrote:
Peter Verswyvelen wrote:
The following code, when compiled with GHC 6.6.1 --make -O gives a stack
overflow when I enter 100 as a command line argument:
(please don't look at the efficiency
Yep, I totally agree.
At our school, we're teaching the students assembly language, starting with
8-bit 6502 assembly :-)
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Henning Thielemann
Sent: Tuesday, October 09, 2007 10:06 AM
To: Derek Elkins
Cc:
fails.
Also typing runhugs Setup.hs configure fails with
runhugs: Error occurred
ERROR c:\program
files\winhugs\packages\base\Text\ParserCombinators\ReadP.hs:156 -
Syntax error in type expression (unexpected `.')
Thanks for any help,
Peter Verswyvelen
Henning Thielemann wrote:
There are warrantedly no side effects. It's scientifically approved.
Available without prescription.
:)
Yes, but doctor, my space is leaking! ;-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Henning Thielemann wrote:
It's scientifically approved. Available without prescription.
Doctor doctor, can you curry me?
Okay, I'm gonna stop now :-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
(translating Haskell to SQL),
webservice wrapper generators, webservice security, etc... Any hints on
useful Haskell packages would be very welcome. LINQ takes its ideas from
FP, so maybe Haskell already had something similar for decades? :)
Hugh Perkins wrote:
On 10/3/07, Peter Verswyvelen
Okay, I got one step further now, great!
But when doing runhugs -98 Setup.hs build it complains about not
having CPPHS, and the Windows binary link is broken :(
*404: Not Found*
*The file you have requested
(http://www.cs.york.ac.uk/fp/cpphs-1.5-win32.zip) could not be found on
this
Yes I have. I actually bought the few only F# books available. It's a
nice language, and an incredible amount of work. The Visual Studio
plugin also works well.
But somehow I found Haskell cleaner... Its laziness is a better for me ;-)
But I might switch back to F# someday, and then learning
Yes that would be cool. Similarly, Haskell could also be used to create
something like http://www.soundspectrum.com/g-force. Would be cool to
translate the vector-field code to the GPU, and that has already been
done in Haskell (Vertigo?)
Conal Elliott wrote:
sounds like great fun to me.
that will be useful I guess.
Good luck,
Peter Verswyvelen
avid48 wrote:
On 10/14/07, [EMAIL PROTECTED]
I know that asking helpful humans is nicer than reading docs, but the latter
is usually more instructive, and often more efficient.
Sorry, but from my newbie point of view, I think
/GLUT/examples/RedBook/Image.hs). But
the SDL stuff seems easier...
Thanks,
Peter Verswyvelen
Roel van Dijk wrote:
I say someone binds SDL[1]. (If it hasn't been done already.)
Ask and you shall receive:
http://darcs.haskell.org/~lemmih/hsSDL/
I use those SDL bindings to plot pixels
1 - 100 of 617 matches
Mail list logo
