Re: Literate comments

1992-02-05 Thread Rob Turner
he language". Whether it was processed by a preprocessor or not would be irrelevant. What is "the language"? Is it the Haskell *kernel*, since a (powerful) preprocessor converts programs using a more sugared syntax into it? Rob -- -- Rob Turner, Dept. of Computer Science, University of Hu

irrefutable patterns

1992-02-26 Thread Rob Turner
ause any problems mathematically? Does the ability to reason (relatively) easily about functional programs disappear when they are used? Rob -- -- Rob Turner, Dept. of Computer Science, University of Hull, UK. Internet: [EMAIL PROTECTED] Phone: (0482) 465212

Subtypes

1999-11-17 Thread Rob Turner
em is possibly solved by inheritance in the class system, but that only works for pre-defined classes. Or does it? Maybe subtypes don't fit elegantly into the functional model. Maybe they aren't necessary anyway. Thoughts appreciated. Rob -- -- Rob Turner, Dept. of Computer Science, Uni

Re: Subtypes

1999-11-17 Thread Rob Turner
>we've defined day as the union of weekday and weekend, and have named >the inclusion functions as wd and we. This would be one method, but as has been pointed out already, the constructors 'wd' and 'we' are very intrusive. I'd like to remove them completely. Rob

Re: Arrays and general function representation

1999-11-17 Thread Rob Turner
hing similar by saying (for an example `double' function): double 0 = 0 double 1 = 2 double 2 = 4 double 3 = 6 ... etc Rob -- -- Rob Turner, Dept. of Computer Science, University of Hull, UK. Internet: [EMAIL PROTECTED] Phone: (0482) 465212