Re: polymorphism and dynamically typed languages

Benjamin Ylvisaker wrote:

> It is, in principle, possible to prove some property (e.g.,
> correctness) of a program *running on a particular computer*. As we
> all agree, this is probably not going to be a particularly practical
> thing to do, but it's possible nonetheless. On the other hand,
> proving some property of an arbitrary program *in general* (i.e.,
> independent of what computer you might choose to run it on) is not
> possible.

If the universe is finite, the number of possible computers is finite, too.
So you "only" had to prove the property for every *possible* computer -
voila! ;)

Cheers, Ilja


.