Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with normal-forms
Search options answers only
not deleted
user 988
Questions about normal forms in various contexts, for example normal forms of context-free grammars (Chomsky normal form, Greibach normal form), of formulas (conjunctive normal form, disjunctive normal form), and others.
2
votes
Accepted
Identifying/equating constants in a term rewrite system
Counterexample:
$f(c) \rightarrow f(d)$
In general, there are some modularity theorems for termination and confluence that may apply if, e.g. your constants do not appear at all in any rule.
There …
- 8,317
4
votes
Accepted
When are you supposed to eta-reduce?
Here are some crucial properties about $\beta$ and $\eta$ reductions that explain the strategies for computing normal forms.
We write $\rightarrow_\beta, \rightarrow_\eta$ for a single step of $\beta …
- 8,317