package coq-higman-cf

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

Install

Dune Dependency

github.com Edit opam file Versions (6)

Authors

  1. S
    Stefan Berghofer

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.10.0.tar.gz
md5=27d30246ec18035e8a687c43531a5c23

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.

Tags

keyword: Higman's lemma keyword: extraction category: Mathematics/Combinatorics and Graph Theory category: Miscellaneous/Extracted Programs/Combinatorics

Published: 07 Dec 2019

Dependencies (2)

  1. coq >= "8.10" & < "8.11~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None