Re: [Haskell-cafe] Sinus in Haskell

using the MPFR library for correctly-rounded arbitrary-precision floating point, as exposed in the Sage computer algebra system. Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Sinus in Haskell

On Sat, 2007-11-10 at 01:29 +0100, Daniel Fischer wrote: The above essay was written after much experimentation using the MPFR library for correctly-rounded arbitrary-precision floating point, as exposed in the Sage computer algebra system. Carl Witty Thanks a lot. Since you seem

Re: [Haskell-cafe] ANN: Math.OEIS 0.1

Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Type vs TypeClass duality

dictionary.) Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Help parsing dates and times

://www.w3.org/TR/xmlschema-2/#dateTime (and time zone offsets are required to have a colon in this format). Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

RE: [Haskell] Fingerprints and hashing

in this number of bits. Carl Witty ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] Frisby grammars that have context

, PEG parsers manage to be linar-time by caching the result of attempting to parse a particular nonterminal at a particular input position. If your nonterminal depends on previous input to decide what to accept, then such caching would no longer be valid. Carl Witty

Re: [Haskell-cafe] Data.Generics question

need to worry about the witnesses in all your pattern-matching code, which is annoying. Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] WANTED: grey line layout boxes in vim and emacs

it up and see how much real code it breaks. Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] non-total operator precedence order (was:Fractional/negative fixity?)

or a op1 (b op2 c) Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Fractional/negative fixity?

with a second-pass hand-written operator precedence parser seems to be easier and more popular, and should be easy to adapt to new precedence levels.) Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] function result caching

then takes O(# of bits in the key) extra time and space, which is far better than the O(2^(# of bits in the key)) that an infinite list would use. Carl Witty ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] Partially-applied type synonyms?

/pipermail/haskell-cafe/2004-March/005965.html Carl Witty ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell] Programming language shootout (completing the Haskell entry)

On Fri, 2004-03-26 at 14:39, Sean E. Russell wrote: On Friday 26 March 2004 17:04, Carl Witty wrote: Are you aware of this: 2001-12-12 * Due to wanting to get on with other things, I'm freezing the shootout as is, with no further updates planned. It isn't

RE: turn off let floating

*a) { static int x; return x++; } where you have getCount :: (a - b) - a - Int; then you pass the function and its argument to getCount. This should prevent any unwanted common subexpression elimination. Carl Witty ___ Glasgow-haskell-users mailing list

Re: [Haskell] Programming language shootout (completing the Haskell entry)

... Carl Witty ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] looking for optimization advice

application; you could probably avoid that with weak pointers.) Carl Witty ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

RE: Problem with ghc on Windows ME

a workaround for this? Carl Witty ___ Glasgow-haskell-users mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: Graduate Student

. And I don't want people to think the future of haskell is full of MySQL errors. Sounds like a good idea. It would be nice, though, if the wishlist data were not lost forever; does anybody have a copy they could post somewhere (in static form), or copy into the Wiki? Carl Witty

Re: threaded red-black tree

:-) There is a purely functional implementation of a red-black tree in the MetaPRL system (www.metaprl.org), written in OCaml. For the latest CVS version of this red-black tree code, go to http://cvs.metaprl.org:12000/cvsweb/metaprl/libmojave/stdlib/ (look at lm_map.ml and lm_set.ml). Carl Witty

RE: Type class problem

may be relevant here. He has several papers on deciding when sets of inference rules are terminating, or terminating in polynomial time. (He applies this in the context of automated theorem proving, but it should apply perfectly well to type class inference as well.) Carl Witty