r
/
notebook
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
notebook/notes/abstract-rewriting-systems/normal-form.md

1.3 KiB
Raw Blame History

title TARGET DECK FILE TAGS tags
Normal Form Obsidian::STEM ars::normal
ars

Overview

An object is said to be in normal form if it cannot be reduced any further. Examples of normal form include:

%%ANKI Basic What does it mean for an object to be in normal form? Back: It cannot be rewritten/reduced any further. Reference: Gries, David. The Science of Programming. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.

END%%

%%ANKI Basic What zero-order logical normal form(s) have only \land and \lor operators? Back: CNF and DNF. Reference: Gries, David. The Science of Programming. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.

END%%

%%ANKI Basic What first-order logical normal form(s) writes bound identifiers before free ones? Back: PNF Reference: Gries, David. The Science of Programming. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.

END%%

Bibliography

  • Gries, David. The Science of Programming. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.