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

The Caml Hump: Timbuk


Timbuk is a collection of tools for achieving proofs of reachability over Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree automata).
Homepage ]
Author:Valérie Viet Triem Tong and Thomas Genet.
Last modification date:05-Apr-2002
Development status:Stable
Kind: Libraries :: Native OCaml libraries
Applications written in Caml :: Scientific software
License: Open Source :: GPL
Topic: General purpose libraries :: Data structures