Re: Haskell 2 -- Dependent types?

[Fergus Henderson]

On 25-Feb-1999, Nick Kallen <[EMAIL PROTECTED]> wrote:
> 
> I'm not asking the compiler to deduce anything. I'm talking about run-time
> type matching; this is dynamic types!

Hmm, that seems to be different to what you said last time.
Let me quote:

        [Nick Kallen:]
        > [Fergus:]
        > > If the list is not known to be definitely sorted,
        > > will it check sortedness at runtime?
        >
        > No.

If you have a subtype for sorted lists, then it seems to me
that dynamically checking whether something is in this subtype
will require checking whether the list is sorted, no?

-- 
Fergus Henderson <[EMAIL PROTECTED]>  |  "Binaries may die
WWW: <http://www.cs.mu.oz.au/~fjh>  |   but source code lives forever"
PGP: finger [EMAIL PROTECTED]        |     -- leaked Microsoft memo.