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
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
Carl Witty
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
dictionary.)
Carl Witty
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://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
, 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
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
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
or
a op1 (b op2 c)
Carl Witty
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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
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
/pipermail/haskell-cafe/2004-March/005965.html
Carl Witty
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
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
:-)
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
14 matches
Mail list logo