[Haskell-cafe] type metaphysics

[Luke Palmer]

On Mon, Feb 2, 2009 at 4:23 PM, Matthew Brecknell <haskell at brecknell.org>wrote:

> Luke Palmer wrote:
> > and pick out the ones which denote a total computable function [...]
>
> How important is totality to this argument? If it is important, how do you
> decide it?


It is at the very essence of the argument; it is why there are countable
sets which are computably uncountable:  (nonconstructive) mathematics does
not need to decide, only programs need to do that :-)

Luke
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090202/4105076b/attachment.htm