package coq-higman-s

  1. Overview
  2. No Docs
Higman's lemma on an unrestricted alphabet

Install

Dune Dependency

github.com Edit opam file Versions (6)

Authors

  1. W
    William Delobel <william.delobel@lif.univ-mrs.fr>

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.7.0.tar.gz
md5=4a37fce81b2c3a3e597a6a1af915a719

Description

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".

Tags

keyword: Higman's lemma keyword: well quasi-ordering category: Mathematics/Combinatorics and Graph Theory date: 2007-09-14

Published: 11 Jan 2019

Dependencies (2)

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

Dev Dependencies

None

Used by

None

Conflicts

None