> | [..]
> | sufficient restrictions in this area Haskell's type system would
> | become undecidable, I decided to demonstrate this directly. In this
>
> It's great that you've done this, but I think someone ought to
> point out that this result, and even the basic method, is not
> actually new: You might want to find a copy of the proceedings
Sorry, I never intended to imply this was new -- of course it's known
that this type system is undecidable. My note was essentially a neat
party trick that I decided to distribute more widely. My apologies to
anyone who was misled by my earlier wording.
Regards,
--KW 8-)
--
: Keith Wansbrough, MSc, BSc(Hons) (Auckland) -------------------------:
: PhD Student, Computing Science, University of Glasgow, Scotland. :
: Native of Antipodean Auckland, New Zealand: 174d47' E, 36d55' S. :
: http://www.dcs.gla.ac.uk/~keithw/ mailto:[EMAIL PROTECTED] :
:----------------------------------------------------------------------:
