Article View: comp.lang.functional
Article #362Re: Id array comprehensions revisited
From: Frank Silbermann
Date: Thu, 19 Jul 1990 12:12
Date: Thu, 19 Jul 1990 12:12
18 lines
1058 bytes
1058 bytes
J. Michael Ashley: >> Can anybody else suggest a better definition >> for array comprehensions? What about a >> "set" as a new data structure? Tom Thomson: > what's "new" about "set"? > Sets have been in Hope+ for a long time. It was my understanding that Hope's "set" abstractions violate the axioms of set theory. The elements of Hope's "sets" have an implied ordering accessible to the programmer, and are therefore more accurately described as _list_ comprehensions, i.e. list processing with implicit backtracking. Frank Silbermann fs@rex.cs.tulane.edu Tulane University New Orleans, LA 70118
Technical Details
Message-ID:
<3896@rex.cs.tulane.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!samsung!rex!fsReferences:
<51123@iuvax.cs.indiana.edu> <3219@stl.stc.co.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!samsung!rex!fs From: fs@rex.cs.tulane.edu (Frank Silbermann) Newsgroups: comp.lang.functional Subject: Re: Id array comprehensions revisited Keywords: Id, Haskell, poor array comprehensions Message-ID: <3896@rex.cs.tulane.edu> Date: 19 Jul 90 12:12:55 GMT References: <51123@iuvax.cs.indiana.edu> <3219@stl.stc.co.uk> Organization: Computer Science Dept., Tulane Univ., New Orleans, LA Lines: 18