exenum

AuthorD. Le Botlan <lebotlan@users.forge.ocamlcore.org>
LicenseGPL-3
Homepagehttp://exenum.forge.ocamlcore.org/
Issue Trackerhttp://exenum.forge.ocamlcore.org/
MaintainerD. Le Botlan <lebotlan@users.forge.ocamlcore.org>
Dependencies
&num
ocamlbuild
ocamlfind
Optional dependencies
|camlp4
lwt
PublishedDec 13, 2015
Source [http] https://forge.ocamlcore.org/frs/download.php/1583/exenum-source-0.7.tgz
31ec3baafaff2fbd49eb420728fbf6db
StatisticsInstalled 6 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/exenum/exenum.0.7/opam

Build efficient enumerations for datatypes. Inspired by Feat for Haskell.

The exenum library offers constructors to build enumerations for datatypes, that is, functions from (arbitrarily large) integers to values. Such enumerations are typically used for unit testing. The library is efficient: the n-th element of an enumeration is returned without having computed the (n-1) previous elements. Complexity is in log(n), except for some pathological datatypes. See the homepage for details: http://exenum.forge.ocamlcore.org/ Inspired by Feat: Functional Enumeration of Algebraic Types, by Duregard, Jansson, Wang, Chalmers University. As an example, consider the following datatype: type term = Var of string | App of term * term | Lambda of string * term Using exenum, one may easily generate zillions of different lambda-terms. In our specific example, term number 2000000000000 happens to be ((((x v) (fun u -> y)) ((fun u -> y) (fun y -> y))) (((x v) (fun u -> v)) (fun u -> y))) Efficiency: computing lambda-term number 1E200 is instantaneous (on an antique Intel Centrino).

Necessary for
cryptodbm