package coq-higman-cf

  1. Overview
  2. No Docs
A direct constructive proof of Higman's Lemma

Install

Dune Dependency

Authors

Maintainers

Sources

v8.5.0.tar.gz
md5=d7aa48da8599c6f16969e195bf7c61e0

Description

This development formalizes in Coq the Coquand-Friedlender proof of Higman's lemma for a two-letter alphabet. An efficient program can be extracted from the proof.

Dependencies (2)

  1. coq >= "8.5" & < "8.6~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None