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).
-
Notifications
You must be signed in to change notification settings - Fork 0
sergei-romanenko/agda-Higman-lemma
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Constructive proofs of Higman’s lemma formalized in Agda
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published