Formal models for some features of programming languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Formal models for some features of programming languages

Full text

Pdf (427 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the first annual ACM symposium on Theory of computing table of contents

Marina del Rey, California, United States

Pages: 211 - 215

Year of Publication: 1969

Author

H. Paul Zeiger

Assistant Professor, University of Colorado, Boulder, Colorado

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 17, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800169.805435 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Dana Scott, Some Definitional Suggestions for Automata Theory, Conference on Algebraic Theory of Machines, Languages, and Semigroups, Pacific Grove, California, Aug. 1966.
	2	Donald E. Knuth , Richard H. Bigelow, Programming Language for Automata, Journal of the ACM (JACM), v.14 n.4, p.615-635, Oct. 1967 [doi>10.1145/321420.321421]
	3	John McCarthy, A Basis for a Mathematical Theory of Computation, Braffort & Hirschberg (eds.) Computer Programming and Formal Systems, North Holland Pub. Co., Amsterdam, 1963, pp. 33-70.
	4	Chomsky & Schutzenberger, The Algebraic Theory of Context-free Languages in Braffort & Hirschberg (eds.) Computer Programming and Formal Systems, North Holland Pub. Co., Amsterdam, 1963, pp. 118-161.
	5	Hopcroft & Korenjak, Simple Deterministic Languages, Seventh Annual Symposium on Switching and Automata Theory, IEEE.
	6	Daniel J. Rosenkrantz, Matrix Equations and Normal Forms for Context-Free Grammars, Journal of the ACM (JACM), v.14 n.3, p.501-507, July 1967 [doi>10.1145/321406.321412]
	7	Bryan Higman, A Comparative Study of Programming Languages, American Elsevier, 1967.