Formal models for some features of programming languages

Authors:
H. Paul Zeiger
Affiliations:
Assistant Professor, University of Colorado, Boulder, Colorado
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 3
Cited 2

Matrix Equations and Normal Forms for Context-Free Grammars

Journal of the ACM (JACM)
Programming Language for Automata

Journal of the ACM (JACM)
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)

The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

Journal of the ACM (JACM)
Program equivalence and context-free grammars

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we attempt to tighten the connections between classical mathematics, automata theory, and the theory of programming languages. Formal linguistic objects corresponding to programs are defined via sets of functional equations; two interpretations of such an object are given, one in classical mathematics, and one in terms of an abstract machine that executes the program. Within this framework we examine flow charts, recursion, parameterization, and declaration.