Subrecursive Programming Languages, Part I: efficiency and program structure

The structural complexity of programming languages, and therefore of programs as well, can be measured by the subrecursive class of functions which characterize the language. Using such a measure of structural complexity, we examine the tradeoff relationship between structural and computational complexity. Since measures of structural complexity directly related to high level languages interest us most, we use abstract language models which approximate highly struc+, "-,., +

[1]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[2]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[3]  Forbes D. Lewis,et al.  The Enumerability and Invariance of Complexity Classes , 1971, J. Comput. Syst. Sci..

[4]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[5]  Albert R. Meyer,et al.  Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.

[6]  A. Grzegorczyk.  Some classes of recursive functions , 1964 .

[7]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

[8]  Allan Borodin,et al.  Complexity Classes of Recursive Functions and the Existence of Complexity Gaps , 1969, Symposium on the Theory of Computing.

[9]  Journal of the Association for Computing Machinery , 1961, Nature.

[10]  Abraham Robinson,et al.  Random-Access Stored-Program Machines, an Approach to Programming Languages , 1964, JACM.

[11]  Manuel Blum,et al.  On Effective Procedures for Speeding Up Algorithms , 1971, JACM.

[12]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[13]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[14]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[15]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[16]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[17]  Robert L. Constable,et al.  On the size of programs in subrecursive formalisms , 1970, STOC.

[18]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[19]  J. P. Cleave,et al.  A Hierarchy of Primitive Recursive Functions , 1963 .

[20]  Robert W. Floyd,et al.  Notes on Avoiding "go to" Statements , 1971, Information Processing Letters.

[21]  Erwin Engeler,et al.  Formal languages; automata and structures , 1968 .

[22]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[23]  P. Wegner.  Programming Languages, Information Structures, and Machine Organization. , 1968 .

[24]  R. Robinson.  Primitive recursive functions , 1947 .

[25]  R. Constable.  Upward and Downward Diagonalization over Axiomatic Complexity Classes , 1969 .

[26]  Patrick C. Fischer,et al.  On Computational Speed-Up , 1968, SWAT.

[27]  Robert W. Ritchie,et al.  CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .