Multiple tense computer programming

Publisher Website
Google Scholar
Abstract
A programming language concept which uses natural language operand qualifiers is proposed as an addition to current high level programming languages. This language concept allows the programmer to access both past and future values of operands and operators by using natural language tense qualifiers. Current computer languages require explicit array manipulation by the program to maintain and access previous operand values; not the one-to-one mapping of problem quantities to program operands that is desirable. Instead they represent a one-to-many mapping. The control and use of this forced multiple mapping seriously increases the complexity of our algorithms.A BNF for qualifying phrases which may be used to modify operands is presented. Examples of some permissible qualifiers for an operand A are PREVIOUS A, NEXT A, FIRST A, TENTH A, ANY A, ALL A'S, 1ST THROUGH 7TH A'S. These qualifiers provide the computer programmer with the ability to specify algorithms in a computer language which more closely resembles a natural language.Since the concept implies a distinctly non-Von Neuman computer, several possible implementations using current software and hardware techniques are suggested.

This publication has 7 references indexed in Scilit: