L(ID:7748/)

Multiple line function generator 

for Lexicon

Basu, ICC, 1967
References:
  • Basu, S. K. "ON COMPUTATION IN PROGRAMMING LANGUAGES" ICC Bulletin, vol. 6, pages 1-26. 1967 January-March. view details
  • Review of Basu 1967 view details Abstract: Describes a model for a programming language L and a class of basic structures equivalent to a program. The formal notion of a computation based on such a program is then described which leads to a definition of the class of functions realizable in the language. The paper then describes an algorithm for transformation of the two-dimensional program structure to a linear string, and defines some string functions and predicates for subsequent use. The existence is then shown of a finite state machine (L-machine) equipped with a potentially infinite memory in the form of a Lexicon that is capable of carrying out the computation as defined. The machine takes as input, the linear string representing the program and an initial assignment of values to the input arguments. The computability of the class of partial recursive functions in the model is demonstrated.
          in Sigplan Notices December 1967 view details