Problemresearch
Nominal unification problem
Also called nominal unification.
Unification over terms with name binders, using permutation and freshness constraints.
Unification over terms with name binders, using permutation and freshness constraints.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag W32K9K Edit this page History Report an error