An Haskell compilation server

2001-01-17 Thread Sebastien Carlier
How about turning ghc into a compilation server ? It would run as a daemon waiting for network connections, retrieve source files (through the same network socket, or nfs, or cvs, ...), compile them locally, and send back the result. This would prevent having to reload the compiler for each file -

Re: An Haskell compilation server

2001-01-17 Thread John Meacham
the benefits may not be as great as you suppose, modern operating systems keep a buffer cache which contains all recently used data in memory including executables, if your machine is not memory limited (such that the OS would have to throw away your ghc pages to make room for something else) then

Re: An Haskell compilation server

2001-01-17 Thread Sebastien Carlier
John Meacham wrote: > the benefits may not be as great as you suppose, modern operating > systems keep a buffer cache which contains all recently used data in > memory including executables, if your machine is not memory limited > (such that the OS would have to throw away your ghc pages to make

Re: An Haskell compilation server

2001-01-17 Thread Michael Hanus
Sebastien Carlier wrote: > How about turning ghc into a compilation server ? > It would run as a daemon waiting for network > connections, retrieve source files (through the > same network socket, or nfs, or cvs, ...), compile > them locally, and send back the result. > This would prevent having t

RE: An Haskell compilation server

2001-01-17 Thread Simon Marlow
> How about turning ghc into a compilation server ? > It would run as a daemon waiting for network > connections, retrieve source files (through the > same network socket, or nfs, or cvs, ...), compile > them locally, and send back the result. > This would prevent having to reload the compiler > f

Re: An Haskell compilation server

2001-01-17 Thread Marcin 'Qrczak' Kowalczyk
Wed, 17 Jan 2001 01:49:25 -0800, Simon Marlow <[EMAIL PROTECTED]> pisze: > Funny you should say that. The next version of GHC (5.00 - to be > released soon) will have hmake-like functionality enabling it to > compile multiple modules without exiting, How to specify .c files to be linked in? Or

Research assistant positions in Bremen

2001-01-17 Thread Till Mossakowski
The following two research assistant positions are available at the University of Bremen, Germany. The Bremen Institute of Safe Systems in the Center for Computing Technologies at the University of Bremen hosts the research projects "Multi-logic systems as a basis for heterogeneous specificati

fixity for (\\)

2001-01-17 Thread Koen Claessen
Hi all, The Haskell report defines the fixity of (\\) to be: infix 5 \\ I propose that it gets the following fixity: infixl 5 \\ This means that one can write: as \\ bs \\ cs \\ ds Which means: (((as \\ bs) \\ cs) \\ ds) I think that one less often means the following: as \\ (b

Re: fixity for (\\)

2001-01-17 Thread Jon Fairbairn
On Wed, 17 Jan 2001, Koen Claessen wrote: > I propose that it gets the following fixity: > > infixl 5 \\ Unless the it's common usage outside of Haskell, I oppose! Getting List> [1,2,3]\\[2]\\[3] ERROR: Ambiguous use of operator "(\\)" with "(\\)" at compile time does no harm, but ge

MD5 in Haskell

2001-01-17 Thread Ian Lynagh
I apologise if this is off topic for this list - I haven't been here long. Someone recently mentioned that the MD5 function in GHC uses C code to do the work so returns an IO String rather than a String. I have written an MD5 implementation in pure Haskell code (following the RFC - I don't know

Re: O'Haskell OOP Polymorphic Functions

2001-01-17 Thread Ashley Yakeley
OK, I've figured it out. In this O'Haskell statement, > struct Derived < Base = > value :: Int ...Derived is not, in fact, a subtype of Base. Derived and Base are disjoint types, but an implicit map of type "Derived -> Base" has been defined. -- Ashley Yakeley, Seattle WA

Re: Finding primes using a primes map with Haskell and Hugs98

2001-01-17 Thread Hannah Schroeter
Hello! On Wed, Dec 20, 2000 at 04:02:23PM +0200, Shlomi Fish wrote: > [...] > primes :: Int -> [Int] > primes how_much = sieve [2..how_much] where > sieve (p:x) = > p : (if p <= mybound > then sieve (remove (p*p) x) > else x) where >