Open-source alternatives to Numberwords

Webpage of the project: http://perso.ens-lyon.fr/damien.pous/ra

A Library for Representing Recursive and Impure Programs in Coq

This repository only contains descriptions. In particular it does not contain code. The actual Coq code is scattered in several sub-projects (see below).

C o L o R , a Rocq library on rewriting theory and termination

This file was generated from meta.yml, please do not edit manually. Follow the instructions on https://github.com/coq-community/templates to regenerate. --->

coq-haskell

```coq From SimpleIO Require Import SimpleIO. From Coq Require Import String. #local Open Scope string_scope.

This Library provides several coq tactics and tacticals to deal with hypothesis during a proof.

This file was generated from meta.yml, please do not edit manually. Follow the instructions on https://github.com/coq-community/templates to regenerate. --->

This file was generated from meta.yml, please do not edit manually. Follow the instructions on https://github.com/coq-community/templates to regenerate. --->

Several Coq projects at MIT use a file called Word.v, defining bit vectors and lemmas about them.

COMPILATION, INSTALLATION, AND DOCUMENTATION:

HOW TO SET UP YOUR ENVIRONMENT

In a nutshell, this library automatically provides a generic way to update record fields. Here's a teaser example:

This file was generated from meta.yml, please do not edit manually. Follow the instructions on https://github.com/coq-community/templates to regenerate. --->

The Coq Library of Undecidability Proofs contains mechanised reductions to establish undecidability results in Coq. The undecidability proofs are based on a synthetic approach to undecidability. A problem P is considered undecidable if its decidability in Coq implies the enumerability of the…

Hahn is a Coq library that contains a useful collection of lemmas and tactics about lists and binary relations.