On 2006-04-03, Daniel Fischer [EMAIL PROTECTED] wrote:
does anybody know whether in a uniquly solvable sudoku-puzzle guessing is
never necessary, i.e. by proper reasoning ('if I put 6 here, then there must
be a 3 and thus the 4 must go there...' is what I call guessing) there is
always at
patc:
Is there an equivalent of an indent program for haskell? I have a
bit of code I want to clean up ...
You could run your code through ghc, with -ddump-parsed turned on.
Then with a little bit of sed magic, you could recover the original code
Before:
$ cat B.hs
main = do {
Hi list,I'm currently working on a pretty simple Haskell program to manipulate memory dumps taken from an embedded environment.The memory dumps are 64MB in length, so I manipulate them using Don Stuart's Fast Packed String library, as it supports mmapped files.
I'm a relative Haskell newbie, so
With a recent snapshot of Cabal you can build a profiled version
of any library as follows (including for FPS):
$ ./Setup.hs configure -p
You'll then see ./Setup.hs build build the lib twice, once with and
once without profiling.
/usr/bin/ar: creating dist/build/libHSfps-0.1.a
Hi Ralf,
Thanks. I'm sorry, now I think that wasn't the source of my problem.
What I want to do is specialise not to a specific type like Bool but
to the class of all pairs (a,b). But this causes the compiler to
complain, even for simpler examples:
cast True :: (Typeable a, Typeable b) = Maybe
On Apr 1, 2006, at 3:23 PM, Brian Hulley wrote:
Robert Dockins wrote:
[snip]
From an earlier post:
Now since f and g compute the same results for the same inputs,
anywhere in a program that you can use f you could just replace f
by g and the observable behaviour of the program would be
On 4/3/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
It would also be nice to see some example sudoku solvers posted
on an `Idioms' page on haskell.org:
http://www.haskell.org/haskellwiki/Category:Idioms
someone could just create a new page 'Sudoku' and add the phrase
Hi Frederik,
[resending; as it bounced because of size.]
That’s a tricky one.
Let’s first recall that this one is still fine:
*Main :t cast True :: (Typeable a, Typeable b) = Maybe (a,b)
cast True :: (Typeable a, Typeable b) = Maybe (a,b) :: (Typeable b,
