Skip to content

Commit 79d8d4d

Browse files
committed
term rewriting: trim
1 parent b8d741a commit 79d8d4d

1 file changed

Lines changed: 0 additions & 8 deletions

File tree

Cards/Term Rewriting and All That.md

Lines changed: 0 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -6,11 +6,6 @@ Term: [normal form]
66

77
Definition: [An expression for which no more rules apply.]
88

9-
C:
10-
Term: [confluence]
11-
12-
Definition: [A property of a rewrite system where, if $x \stackrel{+}{\to} y_1$ and $x \stackrel{+}{\to} y_2$, then $y_1 \join y_2$.]
13-
149
C: A term $x$ is [reducible] iff [there exists a $y$ such that $x \to y$].
1510

1611
C: Saying "$x$ is [irreducible]" is equivalent to saying "$x$ is a [normal form]".
@@ -39,9 +34,6 @@ C: $x$ and $y$ are called [joinable] iff [there exists a $z$ such that $x \stack
3934

4035
C: Let $x$ and $y$ be terms. The notation [$x \join y$] means that $x$ and $y$ are [joinable].
4136

42-
Q: When is a rewrite system confluent?
43-
A: If $x \stackrel{+}{\to} y_1$ and $x \stackrel{+}{\to} y_2$, then $y_1 \join y_2$.
44-
4537
Q: Define confluence in plain language.
4638
A: If two terms have a common (possibly indirect) ancestor, they are joinable.
4739

0 commit comments

Comments
 (0)