Chris F Clark wrote:
Very impressive. It looks right to me and simple enough to
understand. I must find the time to learn a modern FP language. Can
you write a fold for this that prints the data as a binary tree of
triples? I have to believe it isn't that hard
{- Refactoring this as a
. You'll probably also enjoy the paper...
Eliminating Array Bound Checking Through Dependent Types
http://citeseer.ist.psu.edu/xi98eliminating.html
...and DML itself...
http://www.cs.bu.edu/~hwxi/DML/DML.html
Greg Buchholz
--
http://mail.python.org/mailman/listinfo/python-list
/ftp/Haskell/types.html#polyvar-fn
...But now I'm curious about how to create the apply function in a
language like Scheme. I suppose you could do something like...
(define (apply fun args)
(eval (cons fun args)))
...but eval seems a little like overkill. Is there a better way?
Greg
Chris F Clark wrote:
Thus, as we traverse a list, the first element might be an integer,
the second a floating point value, the third a sub-list, the fourth
and fifth, two more integers, and so on. If you look statically at
the head of the list, we have a very wide union of types going by.
George Neuner wrote:
You can't totally prevent it ... if the index computation involves
types having a wider range, frequently the solution is to compute a
wide index value and then narrow it. But if the wider value is out of
range for the narrow type you have a problem.
...snip...
The
