| Date | Name | Description |
|---|
| 2001-08-10 | A generic abstract interpreter |
By Patrick Cousot |
| 2002-11-08 | ActiveBuffer | This library is an extension of the standard Buffer module, to allow to read buffers partially.
By Sébastien Ailleret |
| 2002-10-16 | AIFAD | Improves decision tree learning by supporting significantly more complex kinds of data.
By Markus Mottl |
| 2001-08-10 | automatx | A Caml Light library to manipulate and display trees, graphs and finite automata.
By Michel Quercia |
| 2002-09-09 | Baire | A data structures library.
By Diego Olivier Fernandez Pons |
| 2003-02-21 | Bdd | A binary-decision diagram module.
By Scott Cotton |
| 2001-08-09 | Bindlib | A library for the Objective-Caml, Caml-Light and NJSML languages providing reasonable tools to write programs manipulating data structures with binder (like lambda-calculus or quantified formulae).
By Christophe Raffalli |
| 2001-08-09 | bitv | A bit vectors library.
By Jean-Christophe Filliâtre |
| 2003-09-16 | calendar | An OCaml library managing dates and times.
By Julien Signoles |
| 2002-08-21 | CIL | Infrastructure for C Program Analysis and Transformation.
By Westley Weimer, Scott McPeak, George Necula |
| 2001-11-02 | Creal | An exact real arithmetic module for OCaml.
By Jean-Christophe Filliâtre, David Monniaux |
| 2004-02-18 | Delaunay triangulation | Code from D. Knuth's "Axioms and Hulls''. O(N log N) on the average. Applies to any CCC system.
By Jean-Christophe Filliâtre |
| 2004-09-07 | Dllist | A mutable, circular, doubly linked list library.
By Jesse Guardiani, Brian Hurt |
| 2005-02-18 | Dumper | Dumper is a tiny OCaml library for dumping out data
structures. This is very useful when debugging. It's roughly the
OCaml equivalent of Perl's Data::Dumper.
By Richard W.M. Jones |
| 2004-10-27 | Extlib | A project aiming at providing a complete - yet small - standard
library for the OCaml programming langage.
By Yamagata Yoriyuki, Nicolas Cannasse, Brian Hurt |
| 2003-04-11 | gdome2-xslt | A C and OCaml library to apply XSLT stylesheets to gdome2 documents.
By Claudio Sacerdoti Coen |
| 2001-08-10 | General_Array | Implements unlimited sized arrays (up to 230 elements).
By David McClain |
| 2003-04-11 | gmetadom | A binding to gdome2, the GNU DOM Level 2 implementation.
By Claudio Sacerdoti Coen |
| 2004-01-12 | GrabBag | A collection datastructure. Unordered insertion, uniformly random removal.
By Brock Wilcox |
| 2004-10-27 | Gregorian Date | A pure OCaml library for performing calculations based on the Gregorian calendar.
By Richard W.M. Jones |
| 2003-02-21 | heap | Heaps, imperative and functional implementations.
By Jean-Christophe Filliâtre |
| 2004-04-08 | Libml | Machine Learning Library, a library containing structures and
algorithms, simply usable from most of common languages.
By Matthieu Lagacherie, Olivier Ricordeau |
| 2004-09-07 | LinkedHashtbl | A wrapper for the Objective Caml Hashtbl module that uses a Linked List to preserve the order in which the hash elements are added. It's similar in purpose to the Tie::IxHash module for Perl.
By Jesse Guardiani |
| 2002-04-09 | mtlib | A library with global variable support, mutable lists, mutable binary trees, ...
By Nicolas Cannasse |
| 2004-01-15 | Multiset | A multiset implementation based on the Set module of the standard library.
By Sébastien Briais |
| 2002-08-05 | ocaml-classes | A small library of wrappers around standard library classes, to allow a somehow object-oriented use.
By Jacques Garrigue |
| 2004-03-31 | OCaml-TDL | A small OCaml library providing functions to parse and print TODO lists in XML files.
By Maxence Guesdon |
| 2004-03-01 | ocamlgraph | A graph library. Provides several graph data structures and several graph algorithms. Algorithms are written independently of the graph data structure (using functors).
By Sylvain conchon, Julien Signoles, Jean-Christophe Filliâtre |
| 2004-03-18 | OGPF | OCaml Genetic Programming Framework.
By Brock Wilcox |
| 2003-11-25 | OOoWrite | OOowrite lets you write OpenOffice or StarOffice .sxw files from OCaml programs.
By Richard W.M. Jones |
| 2001-08-09 | Patricia trees | Efficient sets and maps over integers, from a paper by Chris Okasaki.
By Jean-Christophe Filliâtre |
| 2003-11-03 | Persil | A persistent library for Ocaml.
By Basile Starynkevitch |
| 2001-08-09 | POMAP | Library for maintaining partially ordered maps.
By Markus Mottl |
| 2001-11-02 | PsiLAB | Scientific and numerical research environment
By Stefan Bosse |
| 2001-08-09 | Purely Functional Data Structures | Okasaki's Purely Functional Datastructures in OCaml.
By Markus Mottl |
| 2002-06-04 | Recursive | An OCaml module that helps manipulating recursive/regular structures.
By Alain Frisch |
| 2001-08-09 | RES | Library for automatically resizing contiguous memory (arrays and strings).
By Markus Mottl |
| 2001-08-10 | Splay trees | Binary trees where often accessed items tend to be near the root.
By Jean-François Monin |
| 2003-07-21 | Stemmer | An implementation of the Porter stemming algorithm for OCaml.
By Erik Arneson |
| 2002-04-05 | Timbuk | A library of Objective Caml functions designed to manipulate Tree Automata.
By Thomas Genet, Valérie Viet Triem Tong |
| 2001-08-09 | Tries | Implementation of tries (maps over lists)
By Jean-Christophe Filliâtre |
| 2003-03-14 | Wallace | A generic subtyping-constraint-handling library.
By François Pottier |
