A collection of theories and plugins that may be useful in other Coq developments.
- Gregory Malecha (initial)
- Coq-community maintainer(s):
- License: BSD 2-Clause "Simplified" License
- Compatible Coq versions: Coq 8.11 or later or 8.9
- Additional dependencies: none
- Coq namespace:
- Related publication(s): none
Building and installation instructions
The easiest way to install the latest released version of coq-ext-lib is via OPAM:
opam repo add coq-released https://coq.inria.fr/opam/released opam install coq-ext-lib
To instead build and install manually, do:
git clone --recurse-submodules https://github.com/coq-community/coq-ext-lib.git cd coq-ext-lib make theories # or make -j <number-of-cores-on-your-machine> theories make install
- Embrace new features, e.g. universe polymorphism, primitive projections, etc.
- Use modules for controlling namespaces.
- Use first-class abstractions where appropriate, e.g. type classes, canonical structures, etc.
- The library is mostly built around type clases
- Notations should be hidden by modules that are explicitly opened.
- This avoids clashes between precedence.
- TB: Actually, this does not completely avoid clashes, if we have to open two modules at the same time (for instance, I often need to open Equality, to get dependent destruction, which conflicts with the rest of my development)
- TB: I like the idea of having to prefix operations by the name of the module (e.g., DList.fold, DList.map, DList.T), and yet to benefit from the support of notations, without opening this module. I implement that by having a module DList that contains the operations, inside the file DList. The notations live in the file DList, and I do Require Import DList everywhere...
- Avoid the use of the 'core' hint database.
- Avoid the use of dependent functions, e.g. dependendent decidable equality, in favor of their boolen counter-parts. Use type-classes to expose the proofs.
- Base directory to the provided theories