Interesting discussion, but it seems to me that Haskell already
provides the best of both worlds, namely
a. Efficient implementation of arrays as data objects, with indexing
as a projection function; and
b. Definition of functions with (Ix a) domains by indexing an array
behind the
Ken Sailor writes:
>On the other hand, general functions and arrays are typically mixed in
>a program. If the distinction between the two is limited to type
>declarations, then from my perspective it becomes difficult to read
>and understand programs. The difference between functions as rules
>
David Barton writes:
> >And finally, it makes sense to have separate syntax for arrays and
> >general functions, because different behavior is expected for the two.
>
> Here, I may be exposing my cluelessness, but this seems a (search for
> a better word --- none found) silly statement. There