Re: [Haskell] topology in Haskell

On 2004-06-10 at 10:39BST Martin Escardo wrote:

Dear Haskell-list members,

This is to advertise the monograph

Synthetic topology of data types and classical spaces, to appear in ENTCS 87, 150pp, three parts, 6+5+2 chapters.

Interesting. But why do you use Int rather than the Integer? In particular

This gives some surprising results, e.g. that the type ((Int->Bool)->Int) has decidable equality (for total elements).

is not at all surprising, since Int (and Bool) is finite, so there are only finitely many total elements of that type :-) For Integer it is surprising, but I haven't read that far yet... Jón -- Jón Fairbairn Jon.Fairbairn@cl.cam.ac.uk