describe the strong library

let-def · Mar 4, 2020 · cf2ff92 · cf2ff92
1 parent bcfcc5d
commit cf2ff92
Show file tree

Hide file tree

Showing 2 changed files with 16 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -77,6 +77,14 @@ Can be used to experiment and learn about the GC but do expect bugs and don't
 expect any kind of compatibility with future OCaml versions.
 (Would be nice to have proper upstream support for such feature though!)
 
+## strong : Some strongly typed primitives (typed equality, ordering, finite sets)
+
+This library defines a few strongly typed idioms that are sometimes useful in OCaml codebase:
+- type-level equality and ordering
+- unhabitated type
+- an encoding of type-level naturals
+- finite sets (the set of numbers less than a given constant)
+
 ## valmari : Valmari's DFA minimization algorithm
 
 An implementation of the algorithm desribed in [Fast brief practical DFA

diff --git a/grenier.opam b/grenier.opam
@@ -104,6 +104,14 @@ Can be used to experiment and learn about the GC but do expect bugs and don't
 expect any kind of compatibility with future OCaml versions.
 (Would be nice to have proper upstream support for such feature though!)
 
+## strong : Some strongly typed primitives (typed equality, ordering, finite sets)
+
+This library defines a few strongly typed idioms that are sometimes useful in OCaml codebase:
+- type-level equality and ordering
+- unhabitated type
+- an encoding of type-level naturals
+- finite sets (the set of numbers less than a given constant)
+
 ## valmari : Valmari's DFA minimization algorithm
 
 An implementation of the algorithm desribed in [Fast brief practical DFA