Conceptadvanced
Term graph rewriting
Also called graph rewriting of terms.
Rewriting on directed acyclic graphs representing shared terms.
Rewriting on directed acyclic graphs representing shared terms.
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 9DVCYR Edit this page History Report an error