English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

The Caml Hump: Public Domain

Toys - Examples
Cpsio [04-Sep-2002, Development code]
An Objective Caml implementation of the continuation-passing-style output from Olivier Danvy's paper Functional Unparsing.
Author: T. Kurt Bond.
Camlp4 extensions
DBC [10-May-2002, version 1.0.0, Beta]
Simple design-by-contract support using camlp4.
Author: Shawn Wagner.
Scientific software
Felix [17-Feb-2005, version 1.0.20, Stable] Has a documentationHas a tutorial
Felix is an Algol like strongly typed procedural programming language with a strong purely functional subsystem, including first class functions, pattern matching, variants, recursion, and (currently only) compile time parametric polymorphism.
Author: John Skaller.
Scientific software
HOL-light [22-May-2006, version 2.20, Stable] Has a documentationHas a tutorial
HOL Light is a computer program to help users prove interesting mathematical theorems completely formally in higher order logic. It sets a very exacting standard of correctness, but provides a number of automated tools and pre-proved mathematical theorems (e.g. about arithmetic, basic set theory and real analysis) to save the user work. It is also fully programmable, so users can extend it with new theorems and inference rules without compromising its soundness.
Author: John Harrison.
Native OCaml libraries
Lemac [11-Jun-2007, Development code]
A simple GUI for OCaml. It offers two kinds of widgets, to wit, buttons and an Emacs like mini-editor.The idea is to create a GUI with a very small footprint, that is easy to handle for final users, and productive for developers.
Toys - Examples
Octal [06-Mar-2006, Development code]
This is a toy implementation of Zope's TAL (Template Attribute Language) for OCaml, conveniently named 'Octal'. It is built on top of Camlp4 and Xml-Light. The purpose of TAL is to have a template that is a valid XML or HTML document that already renders like the resulting document.
Author: Bruno De Fraine.
Scientific software
RegStab [21-May-2012, version 2.0, Stable]
RegSTAB is a SAT-solver able to deal with formula schemas: you can give it a scheme of formulas such as "/\i=1..n P_i -> P_i+1" (where n is a variable) and it will be able to answer you if *all the formulas of this form (i.e. for every value of n) are unsatisfiable*, i.e. it can treat at once an infinite set of propositional formulas.
Toys - Examples
Servinfo [03-Feb-2004, version 1.0.0, Stable]
A little tool for looking up entries from /etc/services.
Author: Shawn Wagner.