coq-higman-nw

A program from an A-translated impredicative proof of Higman's Lemma. The file Higman.v formalizes an A-translated version of Nash-Williams impredicative and classical proof of Higman's lemma for a two-letter alphabet. A constructive and impredicative program can be extracted from the proof.

opam install coq-higman-nw.8.5.0
homepage
https://github.com/coq-contribs/higman-nw
license
LGPL 2
bugs tracker
https://github.com/coq-contribs/higman-nw/issues
dependencies
coq (>= 8.5 & < 8.6~)
source
https://github.com/coq-contribs/higman-nw/archive/v8.5.0.tar.gz
package
https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-higman-nw/coq-higman-nw.8.5.0