In this chapter, a mathematical treatment of processing structures is presented. It is based on a concise and powerful algebraic system utilizing just fourconnectives. The language accompanying the algebraic system can be considered as truly universal, because it allows us the representation of any processing structure by a single expression, no matter whether it is sequential, concurrent or distributive. The language is unique insofar as conventional computer languages need to make use of nonalgebraical constructs. The theory offers an excellent base for a powerful programming methodology, a methodology where software becomes a matter of calculation and conversion thereby making soft ware production a truly engineering business. In particular, this methodology should lend itself very well to system evolution.

Inspec keywords: programming languages; software engineering; abstract data types

Other keywords: computer languages; software production; nonalgebraical constructs; system evolution; programming methodology; processing structure representation; algebraic system

Subjects: File organisation