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.10.0.tar.gz
md5=44d7e25236ce8c3780391c0de4aef75f

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: 07 Dec 2019

Dependencies (2)

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

Dev Dependencies

None

Used by

None

Conflicts

None