On 06 October 2004 10:10, Christian Maeder wrote:
> after checking out fptools from cvs. The simple sequence
>
> $ autoreconf
> $ ./configure
> $ make
>
> failed in the directory hood, because the target boot is unknown
> there. Could/Should this be fixed?
>
> I know how to use mk/build.mk and t
On 20 July 2004 19:40, Adrian Hey wrote:
> Does anybody know how you hyperlink your Haddock to functions
> whose name ends with a prime. e.g. foldl'
>
> I've tried..
> 'foldl\''
> and
> 'foldl''
>
> But neither works. In each case I get a link to foldl (unprimed
> version) followed b
On 14 July 2004 16:02, Graham Klyne wrote:
> I recall there was a problem with the options for specifying
> alternative main module/function names in the last release of GHC
> that I tested with. Is this now fixed in a generally released
> version?
The -main-is fixes were in 6.2.1.
Cheers,
On 24 June 2004 11:54, MR K P SCHUPKE wrote:
> With reference to "mapException", I thought this seemed a good idea.
> I like the 'AnnotatedException' idea... this is much better than
> concatenating strings... However for not I thought I would test it
> as is, but it doesn't work as I thought - pe
On 24 June 2004 10:31, Alastair Reid wrote:
>> [...]
>> 2. Use the mapException trick to annotate exceptions as they
>> travel up the stack (see Alastair Reid's message). [...]
>> (2) requires that you add lots of annotations to your code, so it's
>> not entirely satisfactory for that rea
On 23 June 2004 18:39, Fergus Henderson wrote:
> On 23-Jun-2004, MR K P SCHUPKE <[EMAIL PROTECTED]> wrote:
>> This may not be the right answer to the question (which is of
>> course lets write a debugger) - But I have never used a debugger,
>> and find them more or less the most unfriendly and use
On 23 June 2004 09:27, Robert Ennals wrote:
> I wrote such a debugger as part of my PhD work. It is called
> "hsdebug" and you can read the Haskell Workshop paper on it here:
>
> http://www.cambridge.intel-research.net/~rennals/hw2003.pdf
>
> Unfortunately, HsDebug depends on Optimistic Evaluati
On 18 June 2004 13:50, Gour wrote:
> Any comment from some experienced Haskell programmer about the latest
> language shootout published on:
>
> http://shootout.alioth.debian.org/index.php
>
> regarding Haskell (ghc-6.2.1) score?
I submitted improved versions for some of the benchmarks.
My f
On 26 April 2004 19:45, Don Groves wrote:
> Hello, Haskell newbie here.
>
> Some languages handle the Int/Integer question automatically,
> determined by the size of the integer in question. Int is used
> until the integer excedes what the underlying architecture can
> handle, then the switch is
A new version of Happy, the parser generator for Haskell, has been
released. Version 1.14 is a small increment relative to 1.13, whose
purpose is mainly to introduce one new feature which will be reuqired to
compile future versions of GHC.
>From the release notes:
* New meta-veriable $>
> But, either way, I'm assuming I can't do this
> (making up syntax):
>
>import Data.FiniteMap using MyPrelude as Prelude
>
> So that every place in FiniteMap that Prelude
> functions are called, MyPrelude functions are
> called instead? Then I could simply redefine just
> and nothing as r
> Has anyone succeeded in getting wxhaskell to work under ghci on Linux?
> On my system, I get an error message
>
> Loading package unix ... ghc-6.2: can't load .so/.DLL for: dl
> (libdl.so: cannot open shared object file: No such file or directory)
>
> This sounds like it has nothing to do wi
> On Tue, 30 Mar 2004, Simon Marlow wrote:
>
> > The upshot of what he found is that we could benefit from some
> > prefetching, perhaps on the order of 10-20%. Particularly
> prefetching
> > in the allocation area during evaluation, to ensure that
> memory ab
> >From: John Hughes <[EMAIL PROTECTED]>
> >Actually the cache behaviour of code generated by GHC isn't
> at all bad.
> >I know because I ran a student project a couple of years ago to
> >implement cache-friendly optimisations. The first thing they did was
> >cache profiling of some benchmark
> Thanks for the info.
>
> Well, according to that explanation, all modules would be
> non-portable since
> the Prelude is normally implemented using non-standard
> features. I think,
> this is solved by declaring all modules described in the
> Haskell 98 Report
> portable.
>
> One quest
> The other day, I tried to compile the Fudgets library with
> GHC-MinGW. It
> didn't work, of course, and having GHC for Cygwin would presumably
> significantly reduce the amount of pain required to port it. (Support
> for certain Posix system calls and symbolic links would be helpful.)
>
>
The (Interactive) Glasgow Haskell Compiler -- version 6.2.1
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC), version 6.2.1.
On a related note, I recently implemented a System.Process library on
Unix. Source code attached. The Windows implementation should be
relatively straightforward. Porting it to Hugs will require
System.Posix.forkProcess, but I don't see any great difficulties there.
One warning: if you want t
> Now, I don't understand this at all...
>
> All the development of the Random stuff in all languages has nothing
> of random whatsoever. Perhaps *some* people like to seed the generator
> with the clock time, but most *real* developers *known to me*
> usually choose
> the seed deterministicall
> why is the Random module situated under System? Wouldn't
> something like Data be more adequate?
There is usually an external source of randomness, which is why the
library in placed in System rather than Data. A purely functional
random library would be rather less useful...
Cheers,
> At 18:07 23/02/04 -0800, John Meacham wrote:
> >It provides regular and monadic versions, a very overloaded
> and useful
> >interface, as well as extensibility. although currently the only
> >instance is based on Text.Regex, it generalizes to matching lists of
> >arbitrary type, not just stri
> >It may seem so to western europeans, but others may differ.
> >A case could be made for UTF-8.
>
> I tend to agree. Further, the choice of defaulting to
> Latin-1 seems a
> strange one when much of the rest of the world (well, the
> networking world)
> seems to be moving towards more uni
> On Mon, Feb 16, 2004 at 10:20:30AM -0000, Simon Marlow wrote:
> > Wolfgang Jeltsch <[EMAIL PROTECTED]> writes:
> > > I meant non-ASCII characters in source code comments like this:
> > > {-|
> > > The execution time of this function is /
> Am Freitag, 13. Februar 2004 01:23 schrieben Sie:
> > wolfgang:
> > > Hello,
> > >
> > > how do I insert non-ASCII and maybe even non-Latin-1 characters in
> > > Haddock documentation?
> > >
> > > Wolfgang
> >
> > Looks like it might be difficult. The haddock lexer src has:
> >
> > $alp
> Dell's poweredge server with the max 12gb RAM costs $15k.
> Moore's law says that
> 1. you only need an extra bit/year.
> 2. processing that extra bit will cost 50% less next year
>
> Though perhaps processing time is not linear with
> the number of bits for historical/architectural
> reasons.
> alex:
> > Is there a maximum memory GHC can use/reach?
> > Specifically, can GHC address more than 4gb of
> > memory?
>
> SimonM may want to comment, but at the moment I think GHC is
> limited to
> 4G, but only due to lack of 64bit machines/demand on the developers.
>
> If you look in ghc/rt
[ posted on behalf of Benaissa, Zino <[EMAIL PROTECTED]> ]
CALL FOR WORKSHOP PROPOSALS
-
Third International Conference on
Generative Programming and Component E
> Am Sonntag, 1. Februar 2004 23:57 schrieb Wolfgang Jeltsch:
> > Hello,
> >
> > I've generated Haddock HTML documentation for some modules.
> There are
> > doc-index-.html files for 15 letters.
> Surprisingly, doc-index.html
> > shows only the letters C, D, F, G, I and T. What's wrong here?
> Wolfgang Thaller writes (to the Haskell mailing list):
>
> > IMHO, there should only be warnings about tabs when their
> > size makes a difference to the meaning of the program,
>
> I agree and would suggest an even more stringent test to
> warn against
>
> > a = let x = 1
> > y = 2
> could Haddock be made to document also fixity declarations?
Yes, it's on the ToDo list.
Cheers,
Simon
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
> > Am Donnerstag, 8. Januar 2004 11:02 schrieben Sie:
> > > [...]
> >
> > > Anyway, you can use GHC to preprocess your source files
> > before feeding
> > > them to Haddock:
> > >
> > >$ ghc -E -cpp -D__HADDOCK__ Foo.hs -o Foo.raw-hs
> >
> > This only replaces all __HADDOCK__ occurences w
> Am Donnerstag, 8. Januar 2004 11:02 schrieben Sie:
> > [...]
>
> > Anyway, you can use GHC to preprocess your source files
> before feeding
> > them to Haddock:
> >
> >$ ghc -E -cpp -D__HADDOCK__ Foo.hs -o Foo.raw-hs
>
> This only replaces all __HADDOCK__ occurences with 1 but
> doesn't
> How do I instruct Haddock to preprocess the Haskell files.
> From your mail I
> thought that Haddock would do so by default but it complains
> at the first
> #ifdef it sees. Unfortunately, I didn't find any Haddock
> option similar to Hugs' -F.
I should really put this in the manual, si
> I think there is some software to translate some DocBook
> derivate to man
> pages. Maybe one could use the DocBook export mechanism of
> Haddock for man
> page production. Just and idea.
Haddock's DocBook output support needs a lot of work - I originally
started on the DocBook output be
> so, A common idiom when using Control.Monad.ST is to do some
> complicated, state using computation to compute a big array which is
> then used purely functionally as a read-only array in the rest of the
> program.
>
> to avoid the cost of copying the array at the end, we are
> forced to use
> hello. a few comments and questions on haddock
> (www.haskell.org/haddock/)
>
> 1. haddock is great
Thanks ;)
> 2. haddock's interpretation of "-- $" is un-great:
>
> I have two types of "-- $" occurences in my code
> that conflict with haddock's idea of "named doc chunks"
>
> a. CVS macr
The (Interactive) Glasgow Haskell Compiler -- version 6.2
We are pleased to announce a new major release of the Glasgow Haskell
Compiler (GHC), version 6.2.
Highlig
> > GHC 6.2 (shortly to be released) also supports toUpper, toLower, and
> the
> > character predicates isUpper, isLower etc. on the full Unicode
> character
> > set.
> >
> > There is one caveat: the implementation is based on the C library's
> > towupper() and so on, so the support is only as g
> But then... what trick does GHC use to prevent CAF leaks?
No tricks really, the garbage collector traces references from code as
well as references from the heap to find all the live data. Of course,
it doesn't actually examine the code; each code segment comes with a
list of top-level closur
> Even in unoptimized, byte-code compiled code?
>
> Take this module:
>
> module A where
>
> t :: IO ()
> t = sequence_ (repeat (return ()))
>
> If I :load it into ghci as interpreted, or if I compile it without
> optimisation options, and I run t, then the process grows, and grow
> On Sat, Nov 29, 2003 at 11:10:57AM -0500, Wojtek Moczydlowski wrote:
> >
> > (though it still bothers me that I don't have an answer yet to the
> > memory leak I posted some time ago)
>
> If you are talking about StateT space leak, then I think I have given
> you an answer. My guess was that
> Unless I'm missing something, the only "support" that GHC provides is
> that Char is 4 bytes.
GHC 6.2 (shortly to be released) also supports toUpper, toLower, and the
character predicates isUpper, isLower etc. on the full Unicode character
set.
There is one caveat: the implementation is based o
> Manuel M T Chakravarty wrote:
>
> > There is `Debug.Trace.trace' for this:
> >
> > http://haskell.org/ghc/docs/latest/html/base/Debug.Trace.html
> >
> > However, if you want to log as opposed to debug, you may
> > want to have the output go to somewhere else but stdout.
> > Hence, it might
> In article <[EMAIL PROTECTED]>,
> "Simon Marlow" <[EMAIL PROTECTED]> wrote:
>
> > There is a new release of Haddock, version 0.6. This
> version has several
> > improvements over the previous release; the full list is below.
>
> Exce
> the Haddock documentation says:
> -S, --docbook
> Reserved for future use (output documentation in SGML
> DocBook format).
> I would appreciate very much if the output wouldn't be just
> in SGML DocBook
> but in XML DocBook format. Would it be possible to implement
> it this way?
> is Haddock compatible with Template Haskell or does it get
> confused by $(...)
> syntax? If it is compatible, how does the documentation of
> TH-generated code look?
There are two issues:
Q. Will Haddock parse a file containing Template Haskell code?
A. No, the parser doesn't currently
> On Tue, 11 Nov 2003 11:01:00 -, "Simon Marlow"
> <[EMAIL PROTECTED]> wrote:
>
> > There is a new release of Haddock, version 0.6.
>
> Are interface files binary-incompatible with those of
> previous releases?
>
> With a Cygwin-compiled
There is a new release of Haddock, version 0.6. This version has several improvements
over the previous release; the full list is
below.
Source and binary distributions can be obtained from Haddock's homepage:
http://www.haskell.org/haddock/
Enjoy!
Simon
Changes in version 0.6:
* Impl
> PS. why the differences in default access to standard modules?
> should GHC be more restrictive there?
No, this is a feature. See
http://www.haskell.org/ghc/docs/latest/html/users_guide/x1097.html#GHCI-SCOPE
in particular section 3.4.1.1.
Cheers,
Simon
__
> On Mon, Oct 13, 2003 at 11:13:56AM +0200, Wolfgang Thaller wrote:
> > The reason why we currently do not take advantage of SMP is
> that the
> > Haskell Heap is a shared data structure which is modified
> whenever a
> > thunk (an unevaluated expression) is evaluated. Using
> synchronisatio
Alastair Reid writes:
> ... Thus, we have Show instances for -> and IO ...
Actually, you have to explicitly import Text.Show.Functions to get the
Show instance for (->).
Cheers,
Simon
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskel
> Pardon? Haskell is a non-strict language. Using 'interact' is one of
> numerous situations where one takes advantage of non-strict semantics.
> (Keith just gave a different example.)
>
> Non-strict semantics does not prescribe the evaluation order, although
> usually lazy evaluation is used. I
Malcolm Wallace writes:
> But the whole purpose of 'interact' is to use its argument as the
> demanding function which drives lazy consumption of the input. It is
> *designed* to reveal the evaluation behaviour, by hoisting it into
> the I/O monad.
This is why interact is bad, IMO: it forces you
> For GHC (6.0.1)
>
> "main=interact id" basically echoes every line of my input, whereas
> "main=interact show" correctly waits for EOF before
> outputting something.
Which of these are you claiming is wrong? This is the behaviour I'd
expect in both cases (although I'd have to go and careful
I think the proposal is great. Here's some random comments:
It might be worth saying earlier on that the library infrastructure is
expected to be a layer underneath the platform's native package support
(if such support exists). For example, I've never used Python's
Distutils, but I have a bunch
> The report states about getChar, getLine, and getContents:
>
> "By default, these input functions echo to standard output."
>
> In version 1.3 of the report, it used to continue
> "Functions in the I/O library provide full control over echoing."
>
> Apparently, this has been removed and the
>{-# LANGUAGE #-}
>
> where is one or more (if compatible) of keywords like
>
> Haskell98 Pure Haskell 98, no extensions.
> SharedExtenisons (Haskell02???) A set of agreed-upon extensions
> implemented by all "major"
> I agree with Marcin,
>
> A... should be split into "A.." and "."
>
> As I read the (on-line) report the "maximal munch" rule says that you
> should read the longest lexeme. It does not say that two
> operators have
> to be separated by whitespace.
>
> Because A... is not a lexeme, the lon
Iavor Diatchki writes:
> what do people think should be the tokens produced by a haskell lexer
> when applied to the following input:
>
>A...
This has been discussed before (a while back, admittedly). See:
http://www.mail-archive.com/[EMAIL PROTECTED]/msg04054.html
GHC (still) gets thi
Mark Jones writes:
> As a solution to that problem, the many-command-line-options
> scheme described seems quite poor! It's far too tool specific,
> not particularly scalable, and somewhat troublesome from a software
> engineering perspective. We're not talking about a choice between
> two poin
> > I also think that having backwards compatability is not much of an
> > issue. After all, ghc has introduces a number of not backward
> > compatable changes to haskell, and I never heard any complaints.
>
> Oh no?
>
> Implicit parameters: I'm sure it is a great thing, but I'd already
> us
> I implemented a trivial "database", stored in ordinary files,
> and had to
> ensure mutual exclusion of database access between
> simultaneously running
> CGI scripts. Since each CGI run is short, I simply locked the entire
> database for the entire run. Claiming a lock on a file is
> easy i
> I do not completely understand the first part of chapter 3 of the
> Haskell-report.
> Concretely I am stumbling about the notation of nonterminals
> indexed by
> their precedence
> level. This should be a number ranging from 0 to 9. But what
> about this exp^{10} production rule?
The gramm
> I have a question about pattern-matching. In the Haskell-report it is
> not postulated, that
> pattern matching has to be exhaustive. Would it be possible at all to
> implement an
> algorithm, which checks Haskell-style patterns for
> exhaustiveness? What
> kinds of
> complication can be ex
> On Tuesday, 2003-08-19, 13:18, Simon Marlow wrote:
> > [...]
>
> > Yes, I agree that one shouldn't rely on the "no duplication of work"
> > property. However, folloing this argument we arrive at the
> conclusion that
> > hGetContents is
> >> Isn't there the possibility of inlining causing a read to
> >> happen twice even if it only appears to happen once?
> >
> >In theory that would be a valid transformation, but in practice no
> >compiler would duplicate arbitrary computations. GHC
> certainly doesn't.
>
> I was thinking of
> >If the databases *do* change over time, then there are two
> >possibilities:
> >
> > 1. the contents change due to external factors only
> > 2. the contents change because this program doing the writing
> >
> >in (1), you can still pretend the interface is pure, by
> imagining that
> >all t
> I'm finishing up my Haskell interface to WordNet
> (http://www.cogsci.princeton.edu/~wn/) and have a standard
> unsafePerformIO question :).
>
> Basically, the interface functions by first calling an initialization
> function, 'initializeWordNet :: IO WordNetEnv'. WordNetEnv is
> essentially
and enjoy,
Simon Marlow: [EMAIL PROTECTED]
Chris Dornan: [EMAIL PROTECTED]
Isaac Jones: [EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
> Ghc should not accept this code, because, no matter how the
> unliterating
> is achieved, it is illegal for a literal string to contain a
> literal newline character.
Known bug in GHC. In the testsuite, but unfortunately not documented.
Cheers,
Simon
__
> just out of curiosity, which is the proper idiom?
>
> trace a = r <- catch a (\e -> putStr "exceptional\n" >> throw e)
> trace a = r <- catch a (\e -> putStr "exceptional\n" >> ioError e)
>
> I am worried that one might subtly change the semantics of an
> execption
> depending on how it wa
=
The (Interactive) Glasgow Haskell Compiler -- version 6.0.1
=
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC), version 6.0.
Haddock version 0.5 is released. Get it from here:
http://www.haskell.org/haddock
Not a great deal has changed from version 0.4, but you need the new
version if you want to build it using recent versions of GHC. Also,
several bugs have been fixed. This is the version of Haddock that we
are
[ replies to [EMAIL PROTECTED] ]
On the whole, I think this is a good direction to explore. I like the
separation of Files from Streams: indeed it would remove much of the
complication in the existing system caused by having Handles which can
be both read and written. Also, it gives a nice way t
> (moderator, can you please include this mail at the bottom of my
> previous mail?)
>
> PS: I think the next example shows pretty well what goes wrong when
> you're not closing the read-handle:
>
> ---
> test = do writeFile' "123.txt" "blaat"
>
> appendFile' "123.txt" " 1"
> z
Simon P.J. writes:
> ... So it's reasonable that there should be some language extension.
> I'm just looking for the minimal such extension.
unsafeCoerce# is quite a minimal extension :-)
Cheers,
Simon
___
Haskell mailing list
[EMAIL PROTECTE
> The Haddock document [1] section 3.3 gives a very simple
> specification for
> the module description, but the accompanying examples [2][3]
> suggest that
> certain common layout in the module description is picked up
> and formatted
> specially. Is there a description of this?
Haddock
> Congratulations on the new release. But out of curiosity, I've got to
> ask...
>
> Why is the test suite now driven by a python script? Is this a
> niche where a 'scripting' language was deemed more suitable than
> haskell?
The test driver makes use of 'eval'-style scripting
The (Interactive) Glasgow Haskell Compiler -- version 6.0
We are pleased to announce a new major release of the Glasgow Haskell
Compiler (GHC), version 6.0.
As with
> (1) unhelpful error message from GHCi:
>
> [[
> Compiling ParsecPrim ( F:\Haskell\Lib/ParsecPrim.hs,
> interpreted )
> WARNING: ignoring polymorphic case in interpreted mode.
> Possibly due to strict polymorphic/functional constructor args.
> Your program may leak space unexpect
> timer f a = do
> t1 <- get current time
> evaluate (f a)
> t2 <- get current time
> return (different in t2 and t1)
>
> where evaluate is from Control.Exception. could someone tell me how
> evaluate compares to seq and deepSeq?
The documentation explains the difference, but it's a bit
> I am very interested in writing server programs in haskell.
>
> There is a link to a paper and code of haskell web server
> in the following page.
>
> http://www.haskell.org/practice.html
>
> I can see the case study paper, but there is no code at
> the link location. I think inspecting through
> I am planning a Haskell project and I need to access files. Since the
> program will be automatically started whenever a mail comes
> in I will need
> to be able to lock the access to files. Is there any support
> for this in some library?
Yes, the Posix library distributed with GHC has suppor
> > IIRC, something very similar was suggested a while back on
> the libraries
> > list, except that the form beginning with a dot was the
> relative module
> > name (actually I think I prefer it that way).
>
> this seems exactly the opposite of what all file systems do. i know
> lateral think
==
The (Interactive) Glasgow Haskell Compiler -- version 5.04.3
==
We are pleased to announce a new patchlevel release of the Glasgow
Haskell Compiler (GHC), version 5
> a recent post reminded me of a feature i'd like.
> for all i know it is already implemenetd in GHC so pointers
> are welcome.
>
> i'd like to be able to dump data structures to disk, and later load
> them.
A Binary library was discussed recently on the libraries list. The
thread starts here
> Oops. I didn't find that. Thanks for the pointer. (Thinks:
> does it work with HUGS?)
It works with the latest hugs, November 2002 (use "hugs +N" to get the
hierarchical libraries).
> A significant amount of my work went into the test cases and
> matching the
> parsing code against the (
> From: Bayley, Alistair [mailto:[EMAIL PROTECTED]
>
> On a related note, what happened to the source code for the
> Haskell Web
> Server?
>
> http://research.microsoft.com/~simonmar/hws.tar.gz
>
> Is it no longer suitable for public consumption? (I have a
> copy at home somewhere, though).
> I have successfully used the the excellent haskell tools
> Happy and Alex in a
> couple of parsing projects, but I have failed when trying to
> combine a
> monadic Happy grammar (using the %monad and %lexer
> directives) together with
> an Alex generated okenizer, nor are there any such e
> You should do the counting strictly:
>
> Just n -> case n+1 of n1 -> addToFM f w n1
Careful - that case expression doesn't actually force n to be evaluated.
It's exactly equivalent to
let n1 = n+1 in addToFM f w n1
You need to use seq to force evaluation.
Cheers,
> What is the limit on open files, and why? I think it'd be nice to
> just schedule a huge amount of IO operations, and have them all be
> performed when required (i.e. when the FM is first accessed).
> Apparently, my addDir took the trouble to open the files, but not
> generate the FMs -- any ide
> > These things are always tricky to understand, which is why
> I recommend
> > not using lazy I/O. File reading is not a pure operation:
> running out
> > of file descriptors is a good counter-example.
>
> Without saying wether I agree with lazy I/O or not, I suggest that
> this particular p
> The following code runs out of file handles, so I am seeking
> enlightenment as to why.
>
> > -- | add data from a file to the histogram
> > addFile :: FiniteMap String Int -> String -> IO (FiniteMap
> String Int)
> > addFile fm name = do
> > x <- readFile name
> > r
[snip]
> It is always a problem to lump things with different semantics into
> the same type :-) What I'm arguing is that there should be only one
> fixed-duration offset datatype and it should be in terms of (seconds,
> picoseconds).
> Other fixed durations can be easily defined in terms of this
>
> For each call, I believe. An exception might be if the call to nco is
> inlined into the calling function, but this is unlikely as nco is
> recursive.
>
> So, you're probably better off with:
>
> > nco wn = nco'
> > where wn' = cis wn
> > nco' = 1 : map (wn'*) nco'
>
> In which
> I was wondering if there is any project that aims to
> interpret haskell within haskell.
>
> Is it feasable that a program can import a user's .hs
> file that has something like:
>
> greeting :: String
> greeting = "Something"
>
> port :: Int
> port = 32 + 33
>
> And the program can parse and
> I wonder what happens to the port when URI parses http URL
> string. Is it
> possible to check for ":" and use the stated port instead of port 80?
> Anyone has experience doing it before?
> Thanks in advance.
> Cheers,
> Gek
The Network.URI library will extract the "host:port":
> authority (f
> With "Foo" in the file c.out and the module
>
> \begin{code}
> module Main (main) where
>
> import IO (openFile, hGetContents, hClose, IOMode(ReadMode))
> import System (getArgs)
> import Monad (when)
>
> main :: IO ()
> main = do [x] <- getArgs
> let you_want_it_to_work = read x
>
> Simon Marlow <[EMAIL PROTECTED]> writes:
> > Also, GHCi retains CAFs in the same way as Hugs, the difference is
> > that GHCi can be configured to throw away the results after
> > evaluation (:set +r).
>
> If I set this flag, does GHCi discard CAFs dur
Alastair Reid writes:
> The workaround is simple enough: add a dummy argument to the CAF (so
> that it is not a CAF any more):
>
>main _ = loop 5
>
> and then specify the extra argument when invoking it:
>
>main ()
>
> (This is a pretty standard optimisation technique: we're tradin
201 - 300 of 496 matches
Mail list logo
