Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Dynamic Programming
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Daniel Andor <da209@c...>
Subject: [Caml-list] Dynamic Programming

I'm wondering about implementation of dynamic programming algorithms in
OCaml -- essentially, how does it relate to recursion?  Does anyone have a
small example or good explanation?

At the moment I'm trying to implement Neville's algorithm, but of course
there are many other practical examples from bioinformatics etc.

There's an interesting webpage about dynamic programming in Haskell (which
is lazy):
How would that approach translate to OCaml without losing all efficiency?


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: