[Haskell-cafe] Any ideas how to go about doing a phd in threading?

2007-08-07 Thread Hugh Perkins
Hi, Really interested in doing a phd on threading. Any ideas how I'd go about doing/applying for that? Basically, threading seems to be the cutting-edge right out (for a while) as processor frequencies top out, and multicores increase. I dont have any formal CS training, but I do have a degree

Re: [Haskell-cafe] Monad for Set?

2007-08-07 Thread Vitaliy Akimov
If you also read the rest of that thread, you'll see that with a recent GHC HEAD, you should be able to avoid the need for the Teq witness. http://www.cs.chalmers.se/~rjmh/Papers/restricted-datatypes.ps here is solution which doesn't require GADT and HEAD, but it does require changing of

Re: [Haskell-cafe] Sudoku Solver

2007-08-07 Thread Murray Gross
I am working on a parallel brute-force solver, which will be tested on 25x25 puzzles (my current serial solver requires less than 1 second for the most difficult 9x9 puzzles I've been able to find; while I haven't tried it on 16x16 puzzles on one of the machines in the Brooklyn College

Re: [Haskell-cafe] Sudoku Solver

2007-08-07 Thread Hugh Perkins
On 8/7/07, Murray Gross [EMAIL PROTECTED] wrote: I am working on a parallel brute-force solver, which will be tested on 25x25 puzzles (my current serial solver requires less than 1 second for the most difficult 9x9 puzzles I've been able to find; while I haven't tried it on 16x16 puzzles on

[Haskell-cafe] Haskell Weekly News: August 07, 2007

2007-08-07 Thread Donald Bruce Stewart
--- Haskell Weekly News http://sequence.complete.org/hwn/20070807 Issue 64 - August 07, 2007 --- Welcome to issue 64 of HWN, a weekly newsletter

Re: [Haskell-cafe] Sudoku Solver

2007-08-07 Thread Hugh Perkins
On 8/7/07, Hugh Perkins [EMAIL PROTECTED] wrote: Question: what do you mean by, for example 25x25? Do you mean grids with a total length of 25 on each side, eg: (because on my super-dooper 1.66GHz Celeron, generating 10 random 25x25 grids such as the one above takes about 1.01 seconds;

[Haskell-cafe] Type classes: Missing language feature?

2007-08-07 Thread DavidA
Hi, there's something I'm trying to do with type classes that seems to fit very naturally with my mental model of type classes, but doesn't seem to be supported by the language. I'm wondering whether I'm missing something, or whether there's some language extension that could help me or

[Haskell-cafe] Re: Type classes: Missing language feature?

2007-08-07 Thread apfelmus
DavidA wrote: newtype Lex = Lex Monomial deriving (Eq) newtype Glex = Glex Monomial deriving (Eq) Now, what I'd like to do is have Lex and Glex, and any further monomial orderings I define later, automatically derive Show and Num instances from Monomial (because it seems like boilerplate

Re: [Haskell-cafe] Type classes: Missing language feature?

2007-08-07 Thread Derek Elkins
On Tue, 2007-08-07 at 12:58 +, DavidA wrote: Hi, there's something I'm trying to do with type classes that seems to fit very naturally with my mental model of type classes, but doesn't seem to be supported by the language. I'm wondering whether I'm missing something, or whether

Re: [Haskell-cafe] Type classes: Missing language feature?

2007-08-07 Thread Tillmann Rendel
DavidA wrote: Now, what I'd like to do is have Lex and Glex, and any further monomial orderings I define later, automatically derive Show and Num instances from Monomial (because it seems like boilerplate to have to define Show and Num instances by hand). Something like the following (not

Re: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Conal Elliott
On 8/5/07, Frank Buss [EMAIL PROTECTED] wrote: Nearly anything works without thinking too much about the types, but I don't like the use of fromInteger in the average and main functions. Is it possible that the integers are automaticly converted to floats? I recommend using Float or Double

RE: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Frank Buss
Hi Conal, I've tried some links, e.g. the pre-compiled components from http://conal.net/Pan/Releases/2000-12-06/ or the interactive presentation from http://conal.net/Pan/papers.htm , but file not found. Do you have the files? Would be easier than trying to setup Haskell and Visual C++

Re: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Jon Harrop
On Tuesday 07 August 2007 21:22:00 Frank Buss wrote: I assume to make it fast, a good idea would be to cache some calculations... If you want to make it fast you should be using hardware acceleration. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. OCaml for Scientists

Re: [Haskell-cafe] Sudoku Solver

2007-08-07 Thread Murray Gross
Yes, by 25x25 puzzles I mean sudoku puzzles with 25 cells on each side, with the smaller squares being 5x5 (i.e., we need to construct rows with the numbers 1-25, and the smaller squares must each contain all of the numbers 1-25). Murray Gross Brooklyn College On Tue, 7 Aug 2007, Hugh

Re: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Conal Elliott
I agree with Jon. And hardware acceleration is in tension with the generality of the extreme generality of formulating images as general (computable) functions on space (and hence arbitrary non-linear transformations, etc). *Unless*, you abandon the traditional acceleration of a fixed set of 2D

Re: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Conal Elliott
Hi Frank, Pan has been bit-rotten for a while now. Besides the unfortunate dependency on Visual C++, it used a now long-obsolete GUI library. That's one reason I started working on Pajama (http://conal.net/Pajama). There's no reason not to create modern, cross-platform successors to Pan/Pajama

Re: [Haskell-cafe] creating graphics the functional way

2007-08-07 Thread Hugh Perkins
On 8/8/07, Conal Elliott [EMAIL PROTECTED] wrote: *Unless*, you abandon the traditional acceleration of a fixed set of 2D (or 3D) primitives and transformations and instead compile into graphics processor code as in http://conal.net/Vertigo . Wow, cool :-)