Constructive proofs of Higman’s lemma formalized in Agda
Agda Isabelle
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
Berghofer
Seisenberger
.gitignore
README.md

README.md

Constructive proofs of Higman’s lemma formalized in Agda

Folders

  • Berghofer : a proof by Stefan Berghofer (for a two-letter alphabet).
  • Seisenberger : proofs by Monika Seisenberger (for a finite alphabet and for an infinite alphabet).