Re: Haskell 2 -- MR, for Curry's sakes go.

1999-02-23 Thread Alex Ferguson
John Launchbury: > I agree that the MR is a pain. [...] > Now we find that some type declarations > contain more class info than type!! And some type(+class) declarations are longer than the definition! This sounds a trite point, but it gets very annoying when one is "rapid-prototyping" (aka hac

Re: Haskell 2 -- Dependent types?

1999-02-23 Thread Fergus Henderson
On 22-Feb-1999, Nick Kallen <[EMAIL PROTECTED]> wrote: > > > min2 :: [a] -> a > > > min2 ((l:ls) :: [a] <= Sorted) = l > > > min2 l = min l > > > > What's the semantics of that supposed to be? > > If the list is not known to be definitely sorted, > > will it check sortedness at runtime? > > No. >

Re: Haskell-2

1999-02-23 Thread Lennart Augustsson
> I think views are really neat, but am not quite sure how I feel about > pattern guards. Views are neat. Pattern guards are an absolute must. They are just The Right Thing when you need them, and working around not having them is clumsy. -- Lennart

CFP WFLP99

1999-02-23 Thread Rachid Echahed
Apologies if you receive multiple copies of this announcement -- CALL FOR PAPERS/PARTICIPATION WFLP'99 8th International Workshop on

Re: Haskell 2 -- Dependent types?

1999-02-23 Thread Fergus Henderson
On 22-Feb-1999, Nick Kallen <[EMAIL PROTECTED]> wrote: > min2 :: [a] -> a > min2 ((l:ls) :: [a] <= Sorted) = l > min2 l = min l What's the semantics of that supposed to be? If the list is not known to be definitely sorted, will it check sortedness at runtime? If not, then the semantics could be