package coq-higman-nw

  1. Overview
  2. No Docs
A program from an A-translated impredicative proof of Higman's Lemma

Install

Dune Dependency

github.com Edit opam file Versions (6)

Authors

  1. H
    Hugo Herbelin

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.7.0.tar.gz
md5=e510b6d4ef8651e009ae1f25390ac972

Description

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.

Tags

keyword: A-translation keyword: Higman's lemma keyword: impredicativity keyword: System F keyword: extraction category: Mathematics/Logic category: Mathematics/Combinatorics and Graph Theory category: Miscellaneous/Extracted Programs/Combinatorics

Published: 11 Jan 2019

Dependencies (2)

  1. coq >= "8.7" & < "8.8~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None