[Haskell-cafe] Compiling an extremely large Haskell file (in GHC)

[Arjun Guha]

As a self-taught Haskell programmer of about a year, I'm really  
interested in seeing your colleague's code.  I'd like to know what I  
did wrong.  How about after two weeks?  I think that's reasonable!

-Arjun

On Jun 28, 2005, at 20:05 , Duncan Coutts wrote:

> On Tue, 2005-06-28 at 12:11 +0300, Radu Grigore wrote:
> > On 6/27/05, Arjun Guha <GUHAARJU at grinnell.edu> wrote:
> > > It's the all-pairs
> > > shortest paths data for a map of the Hyde Park area of Chicago  
> (no real
> > > reason, really).
> >
> > I wonder: is there really no way to do Floyd-Warshall in Haskell?
>
> Indeed I understand from a colleague who implemented an all-pairs
> shortest paths algorithm in Haskell over the weekend for a map of the
> Hyde Park area of Chicago (no real reason, really!), that it takes  
> about
> 0.1 seconds to execute (if you compile with -O), which is well within
> the 5 second limit...
>
> I wonder why everyone is so interested in the distances between
> intersections in the Hyde Park area of Chicago all of a sudden...
>
> http://icfpc.plt-scheme.org/
>
> Duncan
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>