In existing algorithmic programming languages, algorithms are expressed almost exclusively in the present tense. This thesis examines the feasibility of adding tenses other than the present tense to algorithmic languages. The benefits of such extensions are studied with regard to clarity and succinctness of algorithms, readability of programs and efficiency of implementation. / The specifications are given for T-Pascal, a derivate of Pascal with a past tense, a future tense and a subjunctive. The utility of the additional tenses is illustrated by comparing code of programs in T-Pascal with other standard programming language solutions. The results indicate that the additional tenses are practical enhancements to an algorithmic language. An implementation of a compiler for the new language shows that programs in T-Pascal are in most cases as efficient as program written with the conventional tools of an algorithmic language.

No description available.