On the Properties and Applications of Program Schemas

Abstract

The interesting questions one can ask about program schemas include questions about the power of classes of shemas and their decision problems viz. halting, divergence, equivalence, etc. Considered first are the powers of schemas with various features: recursion, equality tests, and several data structures such as pushdown stacks, lists, queues and arrays. Then the decision problems for schemas with equality and with commutative and invertible functions are considered. Finally a generalized class of schemas is described in an attempt to unify the various classes of uninterpreted and semi-interpreted schemas and schemas with special data structures.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1973
Accession Number
AD0758646

Entities

People

  • Ashok K. Chandra

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Artificial Intelligence
  • Automata
  • Automata Theory
  • Calculus
  • Computer Languages
  • Computer Programs
  • Computer Science
  • Computers
  • Construction
  • Formal Languages
  • Grammars
  • Identities
  • Language
  • Simulations
  • Standards

Readers

  • Database Systems and Applications
  • Mathematical Modeling and Probability Theory.