On Classes of Program Schemata

@inproceedings{Constable1971OnCO,
  title={On Classes of Program Schemata},
  author={Robert L. Constable and David Gries},
  booktitle={SIAM J. Comput.},
  year={1971}
}
We define the following classes of program schemata: ${\text{P}} = $ class of schemes using a finite number of simple variables; ${\text{P}}_{\text{A}} = $ class of schemes using simple and subscripted variables (arrays); ${\text{P}}_{{\text{Ae}}} = $ class of schemes in ${\text{P}}_{\text{A}} = $, with the addition of an equality test on subscript values; ${\text{P}}_{\text{R}} = $ class of schemes allowing recursive functions; ${\text{P}}_{\text{L}} = $ class of schemes allowing labels as… 

Program schemes with binary write-once arrays and the complexity classes they capture

TLDR
It is shown that NPSB can be realized as a vectorized Lindstrom logic and logical equivalences of the complexity-theoretic question `Does NP equal PSPACE?' are given.

Program Schemes with Deep Pushdown Storage

TLDR
This work syntactically define sub-classes of $\mbox{NPSDS}_s$ by restricting the occurrences of pops, pushes and deep-pushes and capture the complexity classes NP and PSPACE.

Hierarchies in Classes of Program Schemes

TLDR
This analysis considers computations of program schemes on certain finite structures and shows that the hierarchies in transitive closure logic and NPSS are all proper even when the authors consider only problems involving undirected trees or problems involving out-trees.

Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws

  • I. A. Stewart
  • Mathematics, Computer Science
    Fundam. Informaticae
  • 2001
We prove that a very basic class of program schemes augmented with access to a queue and an additional numeric universe within which counting is permitted accepts exactly the class of recursively

Program schemes, arrays, Lindström quantifiers and zero-one laws

  • I. A. Stewart
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1999

Data flow schemata of maximum expressive power

  • Y. Matsubara
  • Computer Science, Mathematics
    Systems and Computers in Japan
  • 1985
TLDR
This paper proposes class ADF of data flow schemata, whose expressive power is equivalent to that of class EF of effective functional s, and shows that Turing machines can be emulated by ADF schemATA.

Logics of Programs

  • D. KozenJ. Tiuryn
  • Philosophy
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Loop elimination and loop reduction A model-theoretic analysis of programs

  • A. Kfoury
  • Mathematics, Computer Science
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
TLDR
The authors' main interest is in structures that form rings and fields, which will be specified in the following way, respectively: where x and + are binary multiplication and addition ,-and ()-1 are unary negation and inverse, and °and 1 are zeroary.

Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems)

TLDR
This paper defines classes of subrecursive program schemata and investigates their equivalence problems, distinguishing between Pre-Loop and Post-Loop languages on the basis of whether the exit condition in an iteration loop is tested before iteration, as in Algol (Pre-), or after iteration as in FORTRAN (Post-).
...

References

SHOWING 1-4 OF 4 REFERENCES

On Formalised Computer Programs

Recursive functions of symbolic expressions and their computation by machine, Part I

A programming system called LISP (for LISt Processor) has been developed for the IBM 704 computer by the Artificial Intelligence group at M.I.T. The system was designed to facilitate experiments with

High Level Languages of Maximum Power

TLDR
Languages are exhibited which are capable of expressing all such functions computable in a deterministic way and which complements previous work of Paterson and this author who showed that certain flow chart languages, which are usually regarded as universal, were not universal in this sense.

Translating recursion equations into flow charts

This paper proposes the foundations for a systematic study of the translation of recursive function definitions into flow charts (often called the removal of recursions). Several notions of