LOGO VARIATION GENERATOR
With some encouragement and feedback from Jeff Wheeler and Eelco
Lempsink, I created a "Polymorphic" SVG Haskell Logo in Haskell [1].
This script yields a pile of SVG files and an HTML index showing them
off (known to work in Safari 3.0 and Firefox 2.0) [1]:
https://dl
haskell-cafe@haskell.org is usually a better venue for these sorts of
questions. People there love helping people learn Haskell.
And when I try to load it to GHCi I get an error (there is also plenty of
others but they look the same):
couldn't match Int against t t1
This error occurs because
I'm not sure if there is a comprehensive timing summay but here are
some different approaches and code you can compile and run on your
machine:
http://haskell.org/haskellwiki/Sudoku
In fact, if you run them all, you can share your numbers with us and
we can add them to the Sudoku page. And of c
Am I the only one whose first instinct upon reading this is "EW!"?
You are not the only one, judging from my own experience. I made my
own sort of algebraic datatypes / abstract datatypes in C# by using
Enums and Objects and runtime casts. It works, but the code itself is
hairy. I guess the good
I found this in an old post (gotta love GMail search):
You can find further information about the library at the
page http://haskell.org/haskellwiki/Library/Streams and
download it as http://freearc.narod.ru/Streams.tar.gz
from a thread in February entitled:
Streams: the extensible I/O libra
> And: has anyone already built a 'haskell-in-a-box' virtual machine?
Some are working on an all-Haskell-boots-from-scratch OS:
House (Haskell User's Operating System and Environment):
http://www.cse.ogi.edu/~hallgren/House/
>From the page: "House is a demo of software written in Haskell,
runni
The dates on the feed are in international (non-US) order, i.e. Mar 13
2006 = 13/03/2006. Is there a way to make this unambiguous by changing
the month to a word instead of a number? Just curious...
Jared.
On 3/16/06, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
> rjmh:
> > >With a view to
General question to the list:
(Q) Are there any data structures in Haskell similar to C++/STL
vectors or C# generic Lists (i.e. strongly typed ArrayLists, e.g.
List)? These data structures grow automatically as you add
elements to them (but in large chunks, not one node at a time). This
data struc
You could check out the data structures in Edison, a library of myriad
functional data structures. It may already have implemented a sequence
data structure with the desired features:
http://www.eecs.tufts.edu/~rdocki01/docs/edison/index.html
homepage:
http://www.eecs.tufts.edu/~rdocki01/ediso
> Debug.Trace, such as (trace (show foo) a)
> and
> System.IO.Unsafe, such as (unsafePerformIO ( print foo >> return a))
Or see this recent post, a trace that prints line and column numbers:
http://www.haskell.org//pipermail/haskell-cafe/2006-February/014723.html
Jared.
___
> Linking ...
> /usr/bin/ld: cannot find -lSM
> collect2: ld returned 1 exit status
I've had GHC (ld actually) die for similar things like "cannot find
-lgmp". Here is how I fixed it.
Make sure you have libSM, the X Session Management Library, and make
sure that it is in a
11 matches
Mail list logo
