Re: Strictness

Alright. I know the haskell community probably gets tired of my long winded posts. I This post probably shouldn't even be on [EMAIL PROTECTED] (more like on haskell-cafe). I also realize that these posts may not mean much to you; many of you may have figured out most of this strictness business

Re: Hugs plugin, Haskell Browser

> >> function. Sadly, most htmlizers are focused on highlighting > >> rather than navigation. .. > I said "most"! :) (To be honest, I thought about "all") just wanted to point out that there have been several hyperlinking HTML documentation generators for Haskell (in fact, from memory I'm quite

Re: Hugs plugin, Haskell Browser

On Thu, Mar 14, 2002 at 07:29:13PM +, C.Reinke wrote: > >> 2. When I hear "translate to HTML" I imagine that underlined >> words which can be clicked to see, say, definition of >> function. Sadly, most htmlizers are focused on highlighting >> rather than navigation. > > Why generate HTML pa

Re: Strictness

matt hellige writes (to the haskell mailing list): >[..] consider: >sum 0 x = x >sum x y = x + y > >if the first argument is 0, we don't need to inspect the second >argument at all. But sum returns its second argument, so it's still strict in that argument. Cheers, Ronny Wichers Schr

RE: Isn't this tail recursive?

Simon Marlow writes (to the Haskell mailing list) >The function as written is only strict in its list argument, and >its usage site only demands the 'l' argument strictly. So [..] >the compiler can't possibly evaluate the accumulating parameters >of countAll' strictly. The Clean compiler uses a

Re: Isn't this tail recursive?

Another way to evaluate the accumulating counts in each call is to combine them in a data type and use strictness flags for the individual count fields. (See , "Strictness Flags") For example (untested): data Counts = Counts !Int !In

ANNOUNCE: Hat 1.12

hat-1.12, nhc98-1.12, and hmake-3.02 We are pleased to announce a new release of Hat, the Haskell tracing (an debugging) system, together with supporting releases of the nhc98

ICFP'02: 6 days to go.

Last chance for your ICFP'02 paper: 6 days to go. Don't let me down! Simon ICFP 2002 International Conference on Functional Programming October 4-6, 2002,

LAST CALL FOR PAPERS: Generators and Components (GCSE/SAIG'02)

LAST CALL FOR PAPERS Submission Deadline: March 21, 2002 The First ACM SIGPLAN/SIGSOFT Conference on Generators and Components (GCSE/SAIG'02) Supported by the National Science Foundation (NSF)

Re: uniqueness typing

On 12-Mar-2002, Dana Harrington <[EMAIL PROTECTED]> wrote: > > I believe Mercury borrowed their uniqueness type (mode) system from > Clean. Nope. The support for unique modes in Mercury was developed before we were aware of Clean. They achieve similar aims, but it's a case of convergent evolu