[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/800169.805435acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

Formal models for some features of programming languages

Published: 05 May 1969 Publication History

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

[1]
Dana Scott, Some Definitional Suggestions for Automata Theory, Conference on Algebraic Theory of Machines, Languages, and Semigroups, Pacific Grove, California, Aug. 1966.
[2]
Knuth & Bigelow, Programming Languages for Automata, JACM, v. 14, No. 4, Oct. 1967, pp. 615-635.
[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 Rosenkrantz, Matrix Equations and Normal Forms for Context-free Grammars, JACM, vol. 14, No. 3 (July 1967), pp. 501-507.
[7]
Bryan Higman, A Comparative Study of Programming Languages, American Elsevier, 1967.

Cited By

View all
  • (2005)Simple program schemes and formal languagesSimple Program Schemes and Formal Languages10.1007/3-540-06953-4_1(1-254)Online publication date: 25-May-2005
  • (1979)Semantics of probabilistic programsProceedings of the 20th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1979.38(101-114)Online publication date: 29-Oct-1979
  • (1972)Program equivalence and context-free grammarsProceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)10.1109/SWAT.1972.18(7-18)Online publication date: 25-Oct-1972

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '69: Proceedings of the first annual ACM symposium on Theory of computing
May 1969
267 pages
ISBN:9781450374781
DOI:10.1145/800169
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 1969

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)32
  • Downloads (Last 6 weeks)3
Reflects downloads up to 21 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2005)Simple program schemes and formal languagesSimple Program Schemes and Formal Languages10.1007/3-540-06953-4_1(1-254)Online publication date: 25-May-2005
  • (1979)Semantics of probabilistic programsProceedings of the 20th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1979.38(101-114)Online publication date: 29-Oct-1979
  • (1972)Program equivalence and context-free grammarsProceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)10.1109/SWAT.1972.18(7-18)Online publication date: 25-Oct-1972

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media