Re: Random permutations, linear time, fully functional?

Article View: comp.lang.functional

Article #1067

Back to comp.lang.functional Previous Next

#1067

From: Andrew Koenig
Date: Sat, 09 Jan 1993 15:13

10 lines
815 bytes

In article <C0KG2y.HvE@dcs.ed.ac.uk> pdc@dcs.ed.ac.uk (Paul Crowley) writes:

> I believe that Haskell has a way of offering read-only arrays accessible in
> O(1) time and that might go some way towards a solution (for example,
> they solve composition pretty neatly).

As do some recent implementations of ML.
-- 
				--Andrew Koenig
				  ark@europa.att.com

Technical Details

Message-ID: <24581@alice.att.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!usc!cs.utexas.edu!uwm.edu!linac!att!att!allegra!alice!ark

References: <C0KG2y.HvE@dcs.ed.ac.uk>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!usc!cs.utexas.edu!uwm.edu!linac!att!att!allegra!alice!ark
From: ark@alice.att.com (Andrew Koenig)
Newsgroups: comp.lang.functional
Subject: Re: Random permutations, linear time, fully functional?
Message-ID: <24581@alice.att.com>
Date: 9 Jan 93 15:13:54 GMT
Article-I.D.: alice.24581
References: <C0KG2y.HvE@dcs.ed.ac.uk>
Reply-To: ark@alice.UUCP ()
Organization: AT&T Bell Laboratories, Murray Hill NJ
Lines: 10

Reply to Parent Message