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. M
    matej.kosik@inria.fr

Sources

v8.5.0.tar.gz
md5=9929b301e66933897c31c515a03a5c8f

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/Combinatorics and Graph Theory category:Miscellaneous/Extracted Programs/Combinatorics

Published: 07 Jun 2016

Dependencies (2)

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

Dev Dependencies

None

Used by

None

Conflicts

None