[Haskell] Last call: 1st Int'l Workshop on Automated Specification and Verification of Web Sites (WWV'05)

2005-01-02 Thread Santiago Escobar
-- We apologize for multiple copies -- *** 1st International Workshop on Automated Specification and Verification of Web Sites (WWV'05) March 14-15 2005, Valencia, SPAIN

[Haskell] Internships and Post-doctoral Positions at MSR Cambridge

2005-01-02 Thread Don Syme
Dear Haskell-list On behalf of Microsoft Research, Cambridge, I would like to announce that applications for intern positions at our lab for 2005 are now being accepted. Our lab has a number of groups, but of particular interest may be the Programming Principles and Tools group

[Haskell] (Announcement) Hugs98 Port for Windows CE based PocketPC

2005-01-02 Thread Kenny Zhuo Ming LU
Dear all, Happy new year! We proudly announce the alpha release of PPCHugs Project, which is porting Hugs 98 Project to Windows CE based PocketPC. For more details, please refer to the following URL: http://www.comp.nus.edu.sg/~luzm/ppchugs Your comments and feedbacks are welcome! Best Wishes,

[Haskell-cafe] Re: Typed Lambda-Expressions withOUT GADTs

2005-01-02 Thread Ashley Yakeley
In article [EMAIL PROTECTED], Conor McBride [EMAIL PROTECTED] wrote: The latter also means that the existential type encoding of 'some good term' doesn't give you a runnable term. There is thus no useful future-proof way of reflecting back from the type level to the term level. Any

[Haskell-cafe] Problem with fundeps.

2005-01-02 Thread karczma
I am afraid that something is wrong with my understanding of multi- param classes with dependencies. I tried to generalize one of my old packages for quantum *abstract* computations, where state vectors are defined as functional objects, whose codomain has some arithmetic. It is easy to see that

[Haskell-cafe] Re: Problem with fundeps.

2005-01-02 Thread Ashley Yakeley
In article [EMAIL PROTECTED], [EMAIL PROTECTED] wrote: GHCi is correct to complain: class Vspace a v | v - a OK, the first parameter (a) depends on the second (v). instance Vspace a a where And this determines it: the first parameter must always be the same as the second. instance

[Haskell-cafe] Re: Problem with fundeps.

2005-01-02 Thread karczma
Ashley Yakeley writes: GHCi is correct to complain: class Vspace a v | v - a OK, the first parameter (a) depends on the second (v). This is what I want. For a given set of vectors, the associated scalars are unique, otherwise I would have problems with norm. But I have problems anyway...

Re: [Haskell-cafe] Re: Problem with fundeps.

2005-01-02 Thread Marcin 'Qrczak' Kowalczyk
[EMAIL PROTECTED] writes: This is what I want. For a given set of vectors, the associated scalars are unique, otherwise I would have problems with norm. In the instance Vspace a a the compiler doesn't know that a is supposed to be a scalar only. It matches vector types (functions) too. And

[Haskell-cafe] Re: Problem with fundeps.

2005-01-02 Thread Ashley Yakeley
In article [EMAIL PROTECTED], [EMAIL PROTECTED] wrote: This is what I want. For a given set of vectors, the associated scalars are unique, otherwise I would have problems with norm. But I have problems anyway... instance Vspace a a where This says, for any vector type a, the associated

[Haskell-cafe] coercion to Int

2005-01-02 Thread lothar
what coercion can i use to get the below program to compile? i see class (Real a, Fractional a) = RealFrac a where round :: (Integral b) = a - b and class (Fractional a) = Floating a where sqrt :: a - a fillK_ :: Int - Int fillK_ x = round (sqrt x) -- line 2

[Haskell-cafe] coercion to Int

2005-01-02 Thread james pentland
what coercion can i use to get the below program to compile? i see class (Real a, Fractional a) = RealFrac a where round :: (Integral b) = a - b and class (Fractional a) = Floating a where sqrt :: a - a fillK_ :: Int - Int fillK_ x = round (sqrt x) -- line

[Haskell-cafe] Associative array updating

2005-01-02 Thread Dominic Fox
Another newbie question. The following is a naive attempt at a word count function, that takes a string and returns a list of word/count pairs. import Char isLetter c = isAlphaNum c || c=='\'' normalize = map toLower . filter isLetter isWord [] = False isWord s = True nwords =