Theoretical.

One defines abstractions, and then proves properties of the abstractions (theorems). Examples include the theories of automata, formal languages, computability, computational complexity, and queuing systems. Accepted standards of quality include:

• The results must be mathematically valid.
• The abstractions should relate to actual computing problem of interest.
• The results should increase understanding of the problem.
• It is especially good to open up a new area of research, e.g., by defining a new useful abstraction, or by discovering a new proof, algorithm, or analysis technique that has other potential applications.