Browse thread
[Caml-list] looping recursion
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | james woodyatt <jhw@w...> |
| Subject: | Re: [Caml-list] looping recursion |
On 29 Jul 2004, at 09:12, Brian Hurt wrote: > On Thu, 29 Jul 2004, brogoff wrote: >> >> Some problems are just way easier to solve with imperative programming >> though. Have you ever taken a look at purely functional catenable >> deques? > > Just got added to extlib, for the record. A simplistic version that > actually isn't that much more complicated than the imperitive > implementation. This is extraordinary! Do you really mean to say the deques are purely functional, catenable *and* offering the same complexity as the non-persistent implementation? Which algorithm was added to extlib? $B!=(B $B!h(B ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners