coq-higman-s

Higman's lemma on an unrestricted alphabet. This proof is more or less the proof given by Monika Seisenberger in "An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma".

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